On the ordering of graphs with respect to their matching numbers

DOI10.1016/0166-218X(86)90015-6zbMATH Open0646.05049OpenAlexW2004623769MaRDI QIDQ1103635FDOQ1103635

Authors: Ivan Gutman, Fuji Zhang 

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90015-6

Recommendations

• scientific article; zbMATH DE number 4053878
• On the ordering of a class of graphs with respect to their matching numbers
• On ordering of complements of graphs with respect to matching numbers
• On ordering of complements of graphs with respect to matching numbers
• Graphs that contain multiply transitive matchings

zbMATH Keywords

k-matchingsquasi-ordering relation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• On the theory of the matching polynomial
• An introduction to matching polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (35)

• On the k-matchings of the complements of bicyclic graphs
• On ordering of complements of graphs with respect to matching numbers
• Ordering of Hückel trees according to minimal energies
• Extremal energies of trees with a given domination number
• The minimum matching energy of bicyclic graphs with given girth
• Results on energies for trees with a given diameter having perfect matching
• Matchings in starlike trees
• Ordering of the trees by minimal energies
• On the ordering of a class of graphs with respect to their matching numbers
• On extremal unicyclic molecular graphs with maximal Hosoya index
• The matching energy of a graph
• Some relations on the ordering of trees by minimal energies between subclasses of trees
• Ordering of the trees with a perfect matching by minimal energies
• Matching orderable and separable hypergraphs
• Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets
• The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices
• On the matching polynomial of subdivision graphs
• Ordering of Hosoya indices for unicyclic Hückel graphs
• Maximum energy trees with two maximum degree vertices
• Consecutive chemical trees with respect to energy of graph
• On the permanental sum of graphs
• On acyclic conjugated molecules with minimal energies
• On maximal energy and Hosoya index of trees without perfect matching
• The smallest hosoya index in \((n,n+1)\)-graphs
• The largest matching roots of unicyclic graphs with a fixed matching number
• Minimal energies of trees with given parameters
• Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
• The largest Hosoya index of \((n,n+1)\)-graphs
• The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs
• The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4
• Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
• Extremal problems for trees with given segment sequence
• On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index
• Coulson integral formula for the vertex energy of a graph
• The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs

This page was built for publication: On the ordering of graphs with respect to their matching numbers

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