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 “Upper bound for the energy of graphs with fixed second and fourth spectral moments”
Graphs with extremal energy should have a small number of distinct eigenvalues.
-equienergetic self-complementary graphs
Gopalapillai Indulal, Ivan Gutman (2009)
Kragujevac Journal of Mathematics
Similarity:
A conjecture of Biggs concerning the resistance of a distance-regular graph.
Markowsky, Greg, Koolen, Jacobus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Hosoya polynomial of Hanoi graphs
Kishori P. Narayankar, S. B. Lokesh, Veena Mathad, Ivan Gutman (2012)
Kragujevac Journal of Mathematics
Similarity:
Estrada index of iterated line graphs
Tatjana Aleksić, I. Gutman, M. Petrović (2007)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Bounds for the distance energy of a graph
Harishchandra S. Ramane, Deepak S. Revankar, Ivan Gutman, Siddani Bhaskara Rao, B. Devadas Acharya, Hanumappa B. Walikar (2008)
Kragujevac Journal of Mathematics
Similarity:
On the Laplacian spread of trees and unicyclic graphs
Muhuo Liu (2010)
Kragujevac Journal of Mathematics
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: