Note on the spanning-tree packing number of lexicographic product graphs

DOI10.1016/J.DISC.2014.12.007MaRDI QIDQ2514151zbMATH OpenOpenAlexFDO

Authors Hengzhe Li, Yaping Mao, Jun Yue, Xueliang Li

Publication date 30 January 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.12.007

zbMATH Keywords

connectivitypackinglexicographic productedge-disjoint spanning trees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the spanning tree packing number of a graph: A survey
• A short note on the number of spanning trees in lexicographics product of graphs
• Reinforcing the number of disjoint spanning trees
• The number of spanning trees in a new lexicographic product of graphs
• The number of spanning trees of a graph with given matching number

Cites work

• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Graph theory
• On Hamilton circuits and Hamilton paths
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• On the edge‐toughness of a graph. II
• On the spanning tree packing number of a graph: A survey
• Spanning trees: A survey

Cited in

(10)

• A short note on the number of spanning trees in lexicographics product of graphs
• On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices
• On the spanning tree packing number of a graph: A survey
• Reinforcing the number of disjoint spanning trees
• The minimum size of a graph with given tree connectivity
• A note on the packing chromatic number of lexicographic products
• Graphs with large generalized (edge-)connectivity
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
• A result on the 3-generalized connectivity of a graph and its line graph

This page was built for publication: Note on the spanning-tree packing number of lexicographic product graphs

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