Enumeration of spanning trees in a chain of diphenylene graphs
From MaRDI portal
Publication:5865679
Recommendations
- Enumeration of spanning trees of certain graphs
- Enumeration of spanning trees in the sequence of Dürer graphs
- scientific article; zbMATH DE number 5497806
- The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
- On the Kirchhoff index and the number of spanning trees of linear phenylenes
- The enumeration of spanning tree of weighted graphs
- Enumeration of spanning trees of middle digraphs
- Enumeration of spanning trees of 2-separable networks
- scientific article; zbMATH DE number 4152410
- scientific article; zbMATH DE number 861414
Cites work
- Computing harmonic indices of series benzenoid \(H_k\) and hydrocarbons \(PAH_k\) by use of cut method
- Counting the number of spanning trees in the star flower planar map
- Domination topological indices and their polynomials of a firefly graph
- Eccentricity based topological indices of honeycomb networks
- Forgotten domination, hyper domination and modified forgotten domination indices of graphs
- Formulas for the number of spanning trees in a maximal planar map
- Irregularity of Sierpinski graph
- Modified eccentric descriptors of crystal cubic carbon
- Studying thermodynamic properties of linear acenes molecules \((C_{4n+2}H_{2n+4})\) using hyper-Zagreb index
- The hyper-zagreb index for an infinite family of nanostar dendrimer
- The number of spanning trees of certain families of planar maps
- Topological properties of benzenoid, phenylenes and nanostar dendrimers
Cited in
(3)
This page was built for publication: Enumeration of spanning trees in a chain of diphenylene graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865679)