On the number of maximum leaf spanning trees and maximum independent sets in several deterministic networks

MaRDI QIDQ3385753zbMATH OpenFDO

Authors Fei Ma, Bing Yao

Publication date 14 January 2021

zbMATH Keywords

complex networksindependent setspanning tree

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Topological properties of a 3-regular small world network
• Spanning trees of a class of growing network models
• Counting spanning trees in self-similar networks by evaluating determinants
• Spanning trees of totally edge-growing network models
• A family of small-world network models built by complete graph and iteration-function

Cited in

(3)

• Structural and spectral properties of a family of deterministic recursive trees: rigorous solutions
• On the likelihood of forests
• Spanning trees of a class of growing network models

This page was built for publication: On the number of maximum leaf spanning trees and maximum independent sets in several deterministic networks

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