Complexity of graphs generated by wheel graph and their asymptotic limits

DOI10.1016/j.joems.2017.07.005zbMath1378.05198OpenAlexW2742401916MaRDI QIDQ1686390

S. N. Daoud

Publication date: 22 December 2017

Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.joems.2017.07.005

zbMATH Keywords

number of spanning treeswheel graphasymptotic growthgear graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On subtree number index of generalized book graphs, fan graphs, and wheel graphs ⋮ Number of spanning trees in the sequence of some graphs ⋮ The complexity of some classes of pyramid graphs created from a gear graph

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• A certain polynomial of a graph and graphs with an extremal number of trees
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• A survey of some network reliability analysis and synthesis results
• Properties and applications of Laplacian spectra for Koch networks
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Complexity of graphs generated by wheel graph and their asymptotic limits