A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
From MaRDI portal
Publication:2672618
DOI10.1016/j.tcs.2022.05.002OpenAlexW4280651112MaRDI QIDQ2672618
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.002
entropy2-separable networkfractal scale-free networkthe number of spanning connected unicyclic(bicyclic) subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Spanning trees on the Sierpinski gasket
- Enumerating spanning trees of graphs with an involution
- Enumeration of connected spanning subgraphs of a planar graph
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- Sixty years of network reliability
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- Invulnerability of planar two-tree networks
- On the construction of most reliable networks
- The number of spanning trees of a family of 2-separable weighted graphs
- The enumeration of spanning tree of weighted graphs
- Enumeration of spanning trees of 2-separable networks
- Classes of uniformly most reliable graphs for all-terminal reliability
- Enumeration of spanning trees of graphs with rotational symmetry
- The number of spanning trees in Apollonian networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- On the number of spanning trees on various lattices
- A linear-time algorithm to compute the reliability of planar cube-free networks
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- The Complexity of Enumeration and Reliability Problems
- Spanning trees on graphs and lattices inddimensions
- An ensemble of random graphs with identical degree distribution
This page was built for publication: A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
