Matchings in graphs with a given number of cuts

DOI10.1016/J.DAM.2020.01.039zbMATH Open1442.05179OpenAlexW3006141234MaRDI QIDQ2192102FDOQ2192102

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

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

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)

Cites Work

• Graph theory
• Graph Energy
• 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?)
• The Maximal Matching Energy of Tricyclic Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The matching energy of a graph
• The matching energy of graphs with given parameters
• Title not available (Why is that?)
• Minimum energy on trees with \(k\) pendent vertices
• Extremal values of matching energies of one class of graphs
• Extremal bipartite graphs of given connectivity with respect to matching energy
• Title not available (Why is that?)

Cited In (11)

• Matchings in bipartite graphs with a given number of cuts
• Odd Minimum Cut Sets and b-Matchings Revisited
• Matchings in Graphs Variations of the Problem
• Matching cutsets in graphs of diameter 2
• On the number of matchings of graphs formed by a graph operation
• 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 cut in graphs with large minimum degree
• Finding matching cuts in \(H\)-free graphs
• Graphs with the fewest matchings

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)