Characteristics polynomial of normalized Laplacian for trees

DOI10.1016/J.AMC.2015.09.054MaRDI QIDQ1732249zbMATH OpenOpenAlexFDO

Authors Anirban Banerjee, Ranjit Mehatari

Publication date 22 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.7769

zbMATH Keywords

characteristics polynomialdouble starlike treenormalized LaplacianRandić indexstarlike treetree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randi'c indices for matching, whose values depend on the structure of the tree. We also find the expression of these indices for starlike tree and a double-starlike tree, $H_m(p,q)$. Moreover, we show that two cospectral $H_m(p,q)$ of the same diameter are isomorphic.

Recommendations

• On the coefficients of the Laplacian characteristic polynomial of trees
• Laplacian coefficients of trees
• Coefficients of characteristic polynomials of starlike trees
• scientific article; zbMATH DE number 5717282
• Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree

Cites work

• A spectral approach to the Randić index
• An exceptional property of first Zagreb index
• Bounds on Randić indices
• Effect on normalized graph Laplacian spectrum by motif attachment and duplication
• Graphs of extremal weights
• Higher order connectivity index of starlike trees
• scientific article; zbMATH DE number 6704634 (Why is no real title available?)
• scientific article; zbMATH DE number 6704641 (Why is no real title available?)
• scientific article; zbMATH DE number 5259316 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Matchings in starlike trees
• Maximizing the Zagreb indices of (n,m)-graphs
• Minimum vertex covers and the spectrum of the normalized Laplacian on trees
• Note on two generalizations of the Randić index
• On a relation between the Randić index and the chromatic number
• On connective eccentricity index of graphs
• On segments, vertices of degree two and the first Zagreb index of trees
• On the connective eccentricity index of trees and unicyclic graphs with given diameter
• On the higher Randić index
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
• On the spectrum of the normalized graph Laplacian
• One special double starlike graph is determined by its Laplacian spectrum
• Some results on symmetric double starlike trees
• The second Zagreb index of molecular graphs with tree structure
• Three new/old vertex-degree-based topological indices
• Trees of given order and independence number with minimal first Zagreb index
• Vertex-degree-based topological indices over graphs

Cited in

(4)

• Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
• Sombor index of trees with at most three branch vertices
• Coefficients of characteristic polynomials of starlike trees
• Extremal graphs minimizing the normalized Laplacian spectral radius

This page was built for publication: Characteristics polynomial of normalized Laplacian for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732249)