Results 21 to 30 of about 166,225,520 (254)
Number of Spanning Trees of Cartesian and Composition Products of Graphs and Chebyshev Polynomials
IEEE Access, 2019 Enumerating all the spanning trees of a graph without duplication is one of the widely studied problems in electrical engineering and computer science literature.
S. N. Daoud
doaj +1 more source
Formulas for the Number of Spanning Trees in a Chain of Cycles
Sultan Qaboos University Journal for Science, 2010 We give a formula for the number of spanning trees in a chain of cycles that have connected intersection of one edge but where the cycles have variable sizes. The formula uses basic properties of continued fractions.
Thomas Bier
doaj +1 more source
Complexity, 2022 Let Hn be the linear heptagonal networks with 2n heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of Hn, we utilize the method of decompositions. Thus, the Laplacian
Jia-Bao Liu +3 more
doaj +1 more source
The number of spanning trees of cyclic snakes
Indonesian Journal of CombinatoricsA cyclic snake is a connected graph formed by connecting, by means of vertex amalgamation, a certain number of copies of the cycle Cn, in such a way that the i-th copy of Cn is connected with the (i+1)-th copy, resulting in a graph with maximum degree 4.
Christian Barrientos
doaj +1 more source
Entropy and Enumeration of Subtrees in a Cactus Network
Frontiers in Physics, 2020 For a given network, the number of spanning trees is a key parameter to measure its reliability in edge failure cases, while the number of subtrees is a key parameter to measure its reliability in both vertex and edge failures cases.
Lixin Dong, Haixing Zhao, Hong-Jian Lai
doaj +1 more source
Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees [PDF]
, 1934 summary:Let $\alpha (n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees.
Azarija, Jernej +2 more
core +1 more source
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Discussiones Mathematicae Graph Theory, 2016 Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj +1 more source
Spanning trees of finite Sierpiński graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We show that the number of spanning trees in the finite Sierpiński graph of level $n$ is given by $\sqrt[4]{\frac{3}{20}} (\frac{5}{3})^{-n/2} (\sqrt[4]{540})^{3^n}$.
Elmar Teufl, Stephan Wagner
doaj +1 more source
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
An Edge-Swap Heuristic for Finding Dense Spanning Trees
Theory and Applications of Graphs, 2016 Finding spanning trees under various restrictions has been an interesting question to researchers. A "dense" tree, from a graph theoretical point of view, has small total distances between vertices and large number of substructures.
Mustafa Ozen +3 more
doaj +1 more source