The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains

From MaRDI portal
Publication:1733646

DOI10.1016/j.amc.2016.05.024zbMath1410.05128OpenAlexW2418022162MaRDI QIDQ1733646

Shuchao Li, Jing Huang, Xue-Chao Li

Publication date: 21 March 2019

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

Full work available at URL: https://doi.org/10.1016/j.amc.2016.05.024




Related Items

Further results on the expected hitting time, the cover cost and the related invariants of graphsExtremal graphs with diameter 2 for two indices on resistance-distanceSpectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagonsThe first two cacti with larger multiplicative eccentricity resistance-distanceExtremal graphs of bipartite graphs of given diameter for two indices on resistance-distanceResistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a starOn the Kirchhoff index of bipartite graphs with given diametersThe normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applicationsSome transformations on multiplicative eccentricity resistance-distance and their applicationsKemeny's constant and global mean first passage time of random walks on octagonal cell networkOn the normalized Laplacians with some classical parameters involving graph transformationsThe normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenesSome resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P2 and KnThe (degree-) Kirchhoff indices in random polygonal chainsOn the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partitenessTheoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partitenessThe normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphsResistance distances in the linear polyomino chainCalculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chainsExpected hitting times for random walks on quadrilateral graphs and their applicationsOn the extremal graphs with respect to the total reciprocal edge-eccentricityThe normalized Laplacians, degree-Kirchhoff index, and the complexity of Möbius graph of linear octagonal-quadrilateral networksComparison of the Wiener and Kirchhoff indices of random pentachainsResistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphsThe Kirchhoff index and spanning trees of Möbius/cylinder octagonal chainOn the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networksComplete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff indexOn the normalized Laplacian spectral radius, Laplacian incidence energy and Kemeny's constantDumbbell graphs with extremal (reverse) cover cost



Cites Work