Let\(G\) be a graph with vertex set\(V (G)\) and edge set\(E (G)\). Let\(d_i\) be the degree of
the vertex\(v_i\in V (G)\). The first and second Zagreb indices,\(M_1=\sum_ {v_i\in V (G)} d_i …

We extend our previous survey of properties of spectra of signless Laplacians of graphs.
Some new bounds for eigenvalues are given, and the main result concerns the graphs …

Counting polynomials find their way into chemical graph theory through quantum chemistry
in two ways: as approximate solutions to the Schrödinger equation or by storing information …

Zagreb Indices: Bounds and Extremal Graphs Page 1 MCM 19 I. Gutman, B. Furtula, KC Das,
E. Milovanovic, I. Milovanovic (Eds.), Bounds in Chemical Graph Theory – Basics, Univ …

Let G be a graph with n vertices, and let A (G) and D (G) denote respectively the adjacency
matrix and the degree matrix of G. Define A α (G)= α D (G)+(1− α) A (G) for any real α∈[0, 1] …

Starlike trees are determined by their Laplacian spectrum Page 1 Linear Algebra and its
Applications 422 (2007) 654–658 www.elsevier.com/locate/laa Starlike trees are …

A∞-graph is a graph consisting of two cycles with just a vertex in common. We first look for
some invariants for cospectral graphs, then we introduce a new method to determine the …

In this paper, we present a method for characterizing the evolution of time-varying complex
networks by adopting a thermodynamic representation of network structure computed from a …

It is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian
spectrum;[Formula: see text] is determined by its adjacency spectrum, where n1, n2,…, nk …

We extend our previous surveys of properties of spectra of signless Laplacians of graphs.
Some new theorems for the signless Laplacian eigenvalues are given. In particular, a …