Maximum matchings of a digraph based on the largest geometric multiplicity

DOI10.1155/2016/4702387zbMath1400.05190OpenAlexW2345051985WikidataQ59131367 ScholiaQ59131367MaRDI QIDQ1793197

Gang Xie, Yunyun Yang

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/4702387

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum cost perfect matching problem with conflict pair constraints
• The labeled maximum matching problem
• Optimal node ranking of tree in linear time
• Maximum induced matchings close to maximum matchings
• The isomorphism problem for rose window graphs
• Assignment Problems
• Matrix Analysis
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Rankings of Graphs
• Random Walks on Infinite Graphs and Groups
• The minimal Laplacian spectral radius of trees with given matching number
• Digraphs
• Mathematical Description of Linear Dynamical Systems