On the ordering of graphs with respect to their matching numbers
From MaRDI portal
Publication:1103635
DOI10.1016/0166-218X(86)90015-6zbMath0646.05049MaRDI QIDQ1103635
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
ON MAXIMAL ENERGY AND HOSOYA INDEX OF TREES WITHOUT PERFECT MATCHING, Matchings in starlike trees, Minimal energies of trees with given parameters, Extremal energies of trees with a given domination number, The matching energy of a graph, Maximum energy trees with two maximum degree vertices, The smallest hosoya index in \((n,n+1)\)-graphs, The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4, Ordering of Hückel trees according to minimal energies, Ordering of the trees by minimal energies, On extremal unicyclic molecular graphs with maximal Hosoya index, On the matching polynomial of subdivision graphs, Ordering of the trees with a perfect matching by minimal energies, On acyclic conjugated molecules with minimal energies, The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs, Ordering of Hosoya indices for unicyclic Hückel graphs, Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching, Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets, The largest Hosoya index of \((n,n+1)\)-graphs, The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs, Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets, On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index, On the ordering of a class of graphs with respect to their matching numbers, Results on energies for trees with a given diameter having perfect matching
Cites Work
