16 research outputs found
On Maximum Signless Laplacian Estrada Indices of Graphs with Given Parameters
Signless Laplacian Estrada index of a graph , defined as
, where are the
eigenvalues of the matrix . We
determine the unique graphs with maximum signless Laplacian Estrada indices
among the set of graphs with given number of cut edges, pendent vertices,
(vertex) connectivity and edge connectivity.Comment: 14 pages, 3 figure
IJMC Computing Chemical Properties of Molecules by Graphs and Rank Polynomials
ABSTRACT The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The Tutte polynomial of is a polynomial in two variables defined for every undirected graph contains information about connectivity of the graph. The Padmakar-Ivan, vertex Padmakar-Ivan polynomials of a graph are polynomials in one variable defined for every simple connected graphs that are undirected. In this paper, we compute these polynomials of two infinite classes of dendrimer nanostars
Trees with Four and Five Distinct Signless Laplacian Eigenvalues
‎‎Let be a simple graph with vertex set ‎and‎‎edge set ‎.‎The signless Laplacian matrix of is the matrix ‎, ‎such that is a diagonal ‎matrix‎%‎‎, ‎indexed by the vertex set of where‎‎%‎ is the degree of the vertex ‎‎‎ and is the adjacency matrix of ‎.‎%‎ where when there‎‎%‎‎is an edge from to in and otherwise‎.‎The eigenvalues of is called the signless Laplacian eigenvalues of and denoted by ‎, ‎‎, ‎‎, ‎ in a graph with vertices‎.‎In this paper we characterize all trees with four and five distinct signless Laplacian ‎eigenvalues.‎‎
GA2 INDEX OF SOME GRAPH OPERATIONS
Let G = (V, E) be a graph. For e = uv ∈ E(G), nu(e) is the number of vertices of G lying closer to u than to v and nv(e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as 2 nu(e)nv(e). We explore here some mathematical properties and uv∈E(G) nu(e)+nv(e) present explicit formulas for this new index under several graph operations.