Finiteness of spectra of graphs obtained by some operations on infinite graphs.
Torgasev, Aleksandar (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “On the automorphism group of an infinite graph.”
Finiteness of spectra of graphs obtained by some operations on infinite graphs.
On the graphs of Hoffman-Singleton and Higman-Sims.
Hafner, Paul R. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the numbers of positive and negative eigenvalues of a graph.
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments.
Branković, Ljiljana, Miller, Mirka, Plesník, Ján, Ryan, Joe, Širáň, Jozef (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Characterizations of the Family of All Generalized Line Graphs-Finite and Infinite-and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...
Groups and polar graphs
Bohdan Zelinka (1976)
Časopis pro pěstování matematiky
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bipartite diametrical graphs of diameter 4 and extreme orders.
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Identifying graph automorphisms using determining sets.
Boutin, Debra L. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: