Comparing the -independence number of regular graphs to the -independence number of their line graphs
Authors:
- Yair CaroYCYair Caro
- Randy DavilaRDRandy Davila
- Ryan PepperRPRyan Pepper
- 19 May 2025
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 373, 316-326
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On the path partition number of 6‐regular graphsJournal of Graph Theory, 2022
- Regular graphs with equal matching number and independence numberDiscrete Applied Mathematics, 2022
- Cubic graphs with equal independence number and matching numberDiscrete Mathematics, 2021
- Largest 2-Regular Subgraphs in 3-Regular GraphsGraphs and Combinatorics, 2019
- On -domination and -independence in graphsDiscrete Applied Mathematics, 2013
- Tight Lower Bounds on the Size of a Maximum Matching in a Regular GraphGraphs and Combinatorics, 2007
- Tight bounds on maximal and maximum matchingsDiscrete Mathematics, 2004
- Factors of regular graphsJournal of Combinatorial Theory, Series B, 1986
- Regular factors of regular graphsJournal of Graph Theory, 1985
- Die Theorie der regulären graphsActa Mathematica, 1891