Counting spanning trees of (1, N)-periodic graphs
References
[1]
Alfaro C., Valencia C., On the sandpile group of the cone of a graph, Linear Algebra Appl. 436 (2012) 1154–1176.
[2]
Atajan T., Yong X., Inaba H., Further analysis of the number of spanning trees in circulant graphs, Discrete Math. 306 (2006) 2817–2827.
[3]
Biggs N., Algebraic Graph Theory, second ed., CUP, Cambridge, 1993.
[4]
Boesch F., On unreliability polynomials and graph connectivity in reliable network synthesis, J. Graph Theory 10 (1986) 339–352.
[5]
Bondy J., Murty U., Graph Theory with Applications, American Elsevier, New York, 1976.
[6]
Brooks R., Smith C., Stone A., Tutte W., The dissection of rectangles into squares, Duke Math. J. 7 (1940) 312–340.
[7]
Chang S., Chen L., Yang W., Spanning trees on the sierpinski gasket, J. Stat. Phys. 126 (2007) 649–667.
[8]
Chang S., Shrock R., Some exact results for spanning trees on lattices, J. Phys. A 39 (2006) 5653–5658.
[9]
Chen X., Lin Q., Zhang F., The number of spannin trees in odd-valent circulant graphs, Discrete Math. 282 (2004) 69–79.
[10]
Chung F., Yang C., On polynomials of spanning trees, Ann. Comb. 4 (2000) 13–25.
[11]
Ciucu M., Yan W., Zhang F., The number of spanning trees of plane graphs with reflective symmetry, J. Combin. Theory Ser. A 112 (2005) 105–116.
[12]
Crabtree D., Applications of M-matrices to non-negative matrices, Duke Math. J. 33 (1966) 197–208.
[13]
Dhar D., Dhar A., Distribution of sizes of erased loops for loop-erased random walks, Phys. Rev. E 55 (1997) 2093–2096.
[14]
Dorfler F., Bullo F., Kron reduction of graphs with applications to electrical networks, IEEE Trans. Circuits Syst. I: Regul. Pap. 60 (2013) 150–163.
[15]
Fan K., Note on M-matrices, Q. J. Math. 11 (1960) 43–49.
[16]
Goel G., Perkinson D., Critical groups of iterated cones, Linear Algebra Appl. 567 (2019) 138–142.
[17]
Griffing A., Lynch B., Stone E., Structural properties of the minimum cut of partially-supplied graphs, Discrete Appl. Math. 177 (2014) 152–157.
[18]
Grunwald L., Mednykh I., On the Jacobian group of a cone over a circulant graph, Math. Notes NEFU 28 (2021) 88–101,.
[19]
Izmailian N., Kenna R., Wu F., The two-point resistance of a resistor network: a new formulation and application to the cobweb network, J. Phys. A 47 (2014).
[20]
Kim J., Goh K., Salvi G., Oh E., Kahng B., Kim D., Fractality in complex networks: Critical and supercritical skeletons, Phys. Rev. E 75 (2007).
[21]
Kirchhoff G., Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird̈, Annu. Rev. Phys. Chem. 72 (1847) 497–508.
[22]
Kwon Y., Mednykh A., Mednykh I., On complexity of cyclic coverings of graphs, 2018, arXiv:1811.03801.
[23]
Li G., Liu L., Wang Y., Analytic properties of sextet polynomials of hexagonal systems, J. Math. Chem. 59 (2021) 719–734.
[24]
L. Liu, W. Yan, Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications, 457(2023) 128187.
[25]
Martin J., Reiner V., Factorizations of some weighted spanning tree enumerators, J. Combin. Theory Ser. A 104 (2003) 287–300.
[26]
Mednykh A., Mednykh I., The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic, Discrete Math. 342 (2019) 1772–1781.
[27]
Murasugi K., On the invariants of graphs with applications to knot theory, Trans. Amer. Math. Soc. 314 (1989) 1–49.
[28]
Nishikawa T., Motter A., Synchronization is optimal in nondiagonalizable networks, Phys. Rev. E 73 (2006).
[29]
Noh J., Rieger H., Random walks on complex networks, Phys. Rev. E 92 (2004).
[30]
Shrock R., Wu F., Spanning trees on graphs and lattices in d dimensions, J. Phys. A 33 (2000) 3881–3902.
[31]
Stanley R., Algebraic Combinatorics, Springer-Verlag, New York, 2013.
[32]
Temperley H., Enumeration of graphs on a large periodic lattice, in: Combinatorics, CUP, Cambridge, 1974, pp. 155–160.
[33]
Teufl E., Wagner S., Determinant identities for Laplace matrices, Linear Algebra Appl. 432 (2010) 441–457.
[34]
Tutte W., Rotors in graph theory, Ann. Discrete Math. 6 (1980) 343–347.
[35]
Wilf H., Generating Functionology, third ed., A. K. Peters, New York, 2005.
[36]
Wu F., The potts model, Rev. Modern Phys. 54 (1982) 235–268.
[37]
Yan W., Zhang F., Enumeration of spanning trees of graphs with rotational symmetry, J. Combin. Theory Ser. A 118 (2011) 1270–1290.
[38]
Zhang Z., Shan T., Chen G., Random walks on weighted networks, Phys. Rev. E 87 (2013).
[39]
Zhang F., Yan W., Enumerating spanning trees of graphs with an involution, J. Combin. Theory Ser. A 116 (2009) 650–662.
[40]
Zhang F., Yong X., Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs, Sci. China Ser. A 42 (1999) 264–271.
[41]
Zhang Y., Yong X., Golin M., The number of spanning trees in circulant graphs, Discrete Math. 223 (2000) 337–350.
[42]
Zhang Y., Yong X., Golin M., Chebyshev polynomials and spanning tree formulas for circulant and related graphs, Discrete Math. 298 (2005) 334–364.
[43]
Zhou J., Bu C., The enumeration of spanning tree of weighted graphs, J. Algebraic Combin. 54 (2021) 75–108.
Index Terms
- Counting spanning trees of (1, N)-periodic graphs
Index terms have been assigned to the content through auto-classification.
Recommendations
Spanning trees of 3-uniform hypergraphs
Masbaum and Vaintrob s "Pfaffian matrix-tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to the class of ...
Counting spanning trees with a Kekulé structure in linear hexagonal chains
Highlights- We enumerate spanning trees with a Kekule structure in the linear hexagonal chains on the plane.
- We enumerate spanning trees with a Kekule structure in the linear hexagonal chains on the cylinder.
- We enumerate spanning trees with a ...
AbstractIn chemical graph theory, many topological indices of the hexagonal chains, for instance, the energy, Wiener and Kirchhoff indices, and numbers of Kekulé structures and spanning trees, and so on, have been studied extensively. We enumerate ...
Degree restricted spanning trees of graphs
SAC '04: Proceedings of the 2004 ACM symposium on Applied computingLet G = (V, E) be a connected graph and X be a vertex subset of G. Let f be a mapping from X to the set of natural numbers such that f(x) ≥ 2 for all x σ X. A degree restricted spanning tree is a spanning tree T of G such that f(x) ≤ degT(x) for all x σ ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Elsevier B.V.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 14 March 2024
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in