Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs

Wenqian Zhang

doi:10.1016/j.laa.2025.07.033

ScienceGate Book Chapters

JOURNAL ARTICLE

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs

Wenqian Zhang

Year: 2025 Journal: Linear Algebra and its Applications Vol: 726 Pages: 359-370 Publisher: Elsevier BV

DOI: 10.1016/j.laa.2025.07.033

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Disjoint sets Eigenvalues and eigenvectors Combinatorics Enhanced Data Rates for GSM Evolution Discrete mathematics Telecommunications Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.30

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs

Metrics

Topics

Related Documents

Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs

Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

The number of disjoint perfect matchings in semi-regular graphs

On the number of disjoint perfect matchings of regular graphs with given edge connectivity

Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs