Matchings in graphs with a given number of cuts

DOI10.1016/J.DAM.2020.01.039MaRDI QIDQ2192102zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 29 June 2020

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

Full work available at URL https://doi.org/10.1016/j.dam.2020.01.039

zbMATH Keywords

cut edgematchingsmatching energycut vertexquasi-order

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Finding the least element of the ordering of graphs with respect to their matching numbers
• On the largest matching roots of graphs with cut edges
• The minimal matching energy of \((n,m)\)-graphs with a given matching number
• On the ordering of a class of graphs with respect to their matching numbers
• Minimizing the \((2n,q)\)-graphs with perfect matchings in terms of the Hosoya index

Cites work

• scientific article; zbMATH DE number 3679880 (Why is no real title available?)
• scientific article; zbMATH DE number 3720958 (Why is no real title available?)
• scientific article; zbMATH DE number 7410909 (Why is no real title available?)
• scientific article; zbMATH DE number 3893246 (Why is no real title available?)
• An introduction to matching polynomials
• Bounds on the matching energy of unicyclic odd-cycle graphs
• Extremal bipartite graphs of given connectivity with respect to matching energy
• Extremal matching energy of bicyclic graphs
• Extremal values of matching energies of one class of graphs
• Graph energy
• Graph theory
• Graphs with extremal matching energies and prescribed parameters
• Maximal matching energy of tricyclic graphs
• Minimum energy on trees with \(k\) pendent vertices
• On the theory of the matching polynomial
• The matching energy of a graph
• The matching energy of graphs with given parameters
• The minimal matching energy of \((n,m)\)-graphs with a given matching number

Cited in

(13)

• Finding the least element of the ordering of graphs with respect to their matching numbers
• Odd Minimum Cut Sets and b-Matchings Revisited
• Matchings in Graphs Variations of the Problem
• On the ordering of a class of graphs with respect to their matching numbers
• Upper bounds for some graph invariants in terms of blocks and cut-vertices
• A note on matching-cut in \(P_t\)-free graphs
• Matching of \(5-\gamma \)-critical leafless graph with a cut edge
• Matching cutsets in graphs of diameter 2
• Finding matching cuts in \(H\)-free graphs
• On the number of matchings of graphs formed by a graph operation
• Matching cut in graphs with large minimum degree
• Graphs with the fewest matchings
• Matchings in bipartite graphs with a given number of cuts

This page was built for publication: Matchings in graphs with a given number of cuts

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