... aka . Nun ist abet aia1~ = aiaka-~ akaia = aka i. Jede Kante [ai, a~] liefert dam_it genau ei... more ... aka . Nun ist abet aia1~ = aiaka-~ akaia = aka i. Jede Kante [ai, a~] liefert dam_it genau einen zus~tzlichen Nachbarn yon a, der mit ask bezeichnet werde. Dutch die Anwendung der Abbildungen ~ e H(X) auf M(a) werden keine neuen Kanten zwischen den Knoten al , . . . ...
A property P of infinite graphs is said to be of finite character if a graph G has property P if ... more A property P of infinite graphs is said to be of finite character if a graph G has property P if and only if every finite vertex-induced subgraph of G has property P. Using a generalization of the well-known Erd˝os-de Bruijn Theo- rem for arbitrary properties of finite character, we present a proof of the Unique Factorization Theorem for additive
... Search; Submit; Help; Your CDS: Your alerts; Your baskets; Your searches. login. Home > Pr... more ... Search; Submit; Help; Your CDS: Your alerts; Your baskets; Your searches. login. Home > Productgraphs. Information; Discussion; Files; Holdings. Book. Title, Product graphs : structure and recognition. This book at Amazon. Author(s), Imrich, W ; Klavzar, Sandi. ...
Abstract We show that any isometric irredundant embedding of a graph into a product of complete g... more Abstract We show that any isometric irredundant embedding of a graph into a product of complete graphs is the canonical isometric embedding. This result is used to design a simple O(mn) algorithm for recognizing Hamming graphs.
Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap... more Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap. (The eigenvalue gap is the difference between the two largest eigenvalues of the adjacency matrix; for reg- ular graphs it equals the second smallest eigenvalue of the Laplacian matrix.) We show that Gn is unique for each n and has maximum di- ameter. This extends work of Guiduli and solves a conjecture implicit in a paper of Bussemaker, ÿ Cobeljic, Cvetkovic, and Seidel. Depending on n, the graph Gn may not be the only one with maximum diameter. We thus also determine all cubic graphs with maximum diameter for a given number n of vertices.
... aka . Nun ist abet aia1~ = aiaka-~ akaia = aka i. Jede Kante [ai, a~] liefert dam_it genau ei... more ... aka . Nun ist abet aia1~ = aiaka-~ akaia = aka i. Jede Kante [ai, a~] liefert dam_it genau einen zus~tzlichen Nachbarn yon a, der mit ask bezeichnet werde. Dutch die Anwendung der Abbildungen ~ e H(X) auf M(a) werden keine neuen Kanten zwischen den Knoten al , . . . ...
A property P of infinite graphs is said to be of finite character if a graph G has property P if ... more A property P of infinite graphs is said to be of finite character if a graph G has property P if and only if every finite vertex-induced subgraph of G has property P. Using a generalization of the well-known Erd˝os-de Bruijn Theo- rem for arbitrary properties of finite character, we present a proof of the Unique Factorization Theorem for additive
... Search; Submit; Help; Your CDS: Your alerts; Your baskets; Your searches. login. Home > Pr... more ... Search; Submit; Help; Your CDS: Your alerts; Your baskets; Your searches. login. Home > Productgraphs. Information; Discussion; Files; Holdings. Book. Title, Product graphs : structure and recognition. This book at Amazon. Author(s), Imrich, W ; Klavzar, Sandi. ...
Abstract We show that any isometric irredundant embedding of a graph into a product of complete g... more Abstract We show that any isometric irredundant embedding of a graph into a product of complete graphs is the canonical isometric embedding. This result is used to design a simple O(mn) algorithm for recognizing Hamming graphs.
Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap... more Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap. (The eigenvalue gap is the difference between the two largest eigenvalues of the adjacency matrix; for reg- ular graphs it equals the second smallest eigenvalue of the Laplacian matrix.) We show that Gn is unique for each n and has maximum di- ameter. This extends work of Guiduli and solves a conjecture implicit in a paper of Bussemaker, ÿ Cobeljic, Cvetkovic, and Seidel. Depending on n, the graph Gn may not be the only one with maximum diameter. We thus also determine all cubic graphs with maximum diameter for a given number n of vertices.
Uploads
Papers by Wilfried Imrich