A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2022.05.002
+Normal rank
@@ Property / OpenAlex ID @@
+W4280651112
@@ Property / OpenAlex ID: W4280651112 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of uniformly most reliable graphs for all-terminal reliability
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees on the Sierpinski gasket
@@ Property / cites work: Spanning trees on the Sierpinski gasket / rank @@
+Normal rank
@@ Property / cites work @@
+Q4301917
@@ Property / cites work: Q4301917 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
+Normal rank
@@ Property / cites work @@
+The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
+Normal rank
@@ Property / cites work @@
+On the construction of most reliable networks
@@ Property / cites work: On the construction of most reliable networks / rank @@
+Normal rank
@@ Property / cites work @@
+The number of spanning trees of a family of 2-separable weighted graphs
+Normal rank
@@ Property / cites work @@
+Sixty years of network reliability
@@ Property / cites work: Sixty years of network reliability / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of connected spanning subgraphs of a planar graph
+Normal rank
@@ Property / cites work @@
+Enumeration of spanning trees of 2-separable networks
+Normal rank
@@ Property / cites work @@
+An iteration method for computing the total number of spanning trees and its applications in graph theory
+Normal rank
@@ Property / cites work @@
+An ensemble of random graphs with identical degree distribution
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to compute the reliability of planar cube-free networks
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+The Complexity of Reliability Computations in Planar and Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Complexity of the maximum leaf spanning tree problem on planar and regular graphs
+Normal rank
@@ Property / cites work @@
+Spanning trees on graphs and lattices in<i>d</i>dimensions
+Normal rank
@@ Property / cites work @@
+On the number of spanning trees on various lattices
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Invulnerability of planar two-tree networks
@@ Property / cites work: Invulnerability of planar two-tree networks / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of spanning trees of graphs with rotational symmetry
+Normal rank
@@ Property / cites work @@
+Enumerating spanning trees of graphs with an involution
+Normal rank
@@ Property / cites work @@
+The number of spanning trees in Apollonian networks
+Normal rank
@@ Property / cites work @@
+The enumeration of spanning tree of weighted graphs
+Normal rank