Equimatchable Regular Graphs
Copyright policy )Equimatchable Regular Graphs
AbstractA graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3‐regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r‐regular graph, then . Also it is proved that for an even r, a connected triangle‐free equimatchable r‐regular graph is isomorphic to one of the graphs C5, C7, and .
- Sharif University of Technology Iran (Islamic Republic of)
- Tarbiat Modares University Iran (Islamic Republic of)
triangle-free graph, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), regular graph, equimatchable, Structural characterization of families of graphs
triangle-free graph, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), regular graph, equimatchable, Structural characterization of families of graphs
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!