Graphs with extremal energy should have a small number of distinct eigenvalues.
Cvetković, D., Grout, J. (2007)
Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques
Similarity:
Displaying similar documents to “On the Laplacian spread of trees and unicyclic graphs”
Graphs with extremal energy should have a small number of distinct eigenvalues.
On graphs whose reduced energy does not exceed 3.
Lazić, Mirjana (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Chromatically unique bipartite graphs with certain 3-independent partition numbers. II.
Hasni, Roslan, Peng, Y.H. (2006)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Introduction to association schemes.
Seidel, J.J. (1991)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Graphs and models with finite chains.
Nurtazin, A.T. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
List -coloring of sparse plane graphs.
Borodin, O.V., Ivanova, A.O., Neustroeva, T.K. (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Path partitions of planar graphs.
Glebov, A.N., Zambalaeva, D.Zh. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Computing the domination number of grid graphs.
Alanko, Samu, Crevals, Simon, Isopoussu, Anton, Östergård, Patric, Pettersson, Ville (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals.
Bernardi, Olivier (2007)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Antichains in the homomorphism order of graphs
Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Let and , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal...
A New Proof of the Szeged-Wiener Theorem
H. Khodashenas, M. J. Nadjafi-Arani, A. R. Ashrafi, I. Gutman (2011)
Kragujevac Journal of Mathematics
Similarity:
Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6.
Borodin, O.V., Ivanova, A.O., Neustroeva, T.K. (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity: