Bounds for the Hückel energy of a graph.
Ghorbani, Ebrahim, Koolen, Jack H., Yang, Jae Young (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ghorbani, Ebrahim, Koolen, Jack H., Yang, Jae Young (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jianfeng Wang, Haixing Zhao, Qiongxiang Huang (2012)
Czechoslovak Mathematical Journal
Similarity:
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph....
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar (2009)
Publications de l'Institut Mathématique
Similarity:
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Harishchandra S. Ramane, Hanumappa B. Walikar, Siddani Bhaskara Rao, B. Devadas Acharya, Prabhakar R. Hampiholi, Sudhir R. Jog, Ivan Gutman (2004)
Kragujevac Journal of Mathematics
Similarity:
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Dragoš Cvetković (2009)
Zbornik Radova
Similarity:
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...