The classification of 2-extendable edge-regular graphs with diameter 2

MaRDI QIDQ668067zbMATH OpenFDO

Authors Klavdija Kutnar, Dragan Marušič, Štefko Miklavič, Primož Šparl

Publication date 5 March 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p16

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Summary: Let \(\ell\) denote a non-negative integer. A connected graph \(\Gamma\) of even order at least \(2\ell+2\) is \(\ell\)-\textit{extendable} if it contains a matching of size \(\ell\) and if every such matching is contained in a perfect matching of \(\Gamma\). A connected regular graph \(\Gamma\) is \textit{edge-regular}, if there exists an integer \(\lambda\) such that every pair of adjacent vertices of \(\Gamma\) have exactly \(\lambda\) common neighbours. In this paper we classify \(2\)-extendable edge-regular graphs of even order and diameter \(2\).

Recommendations

• On extendability of co-edge-regular graphs
• On extendability of Deza graphs with diameter 2
• On the extendability of quasi-strongly regular graphs with diameter 2
• On regular \((2,q)\)-extendable graphs.
• scientific article; zbMATH DE number 861329

Cites work

• Edge-girth-regular graphs
• Extending matchings in graphs: A survey
• Graph theory
• Hamiltonian cycles in n‐extendable graphs
• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 166088 (Why is no real title available?)
• scientific article; zbMATH DE number 166089 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• Max-cut and extendability of matchings in distance-regular graphs
• Maximum degree in graphs of diameter 2
• Notes on factor-criticality, extendibility and independence number
• On 2-extendable abelian Cayley graphs
• On extendability of Cayley graphs
• On extendability of Deza graphs with diameter 2
• On n-extendable graphs
• On quasi-strongly regular graphs
• On regular \((2,q)\)-extendable graphs.
• On regular factors in regular graphs with small radius
• On the extendability of quasi-strongly regular graphs with diameter 2
• Regular clique assemblies, configurations, and friendship in edge-regular graphs
• The 2-extendability of strongly regular graphs
• The extendability of matchings in strongly regular graphs

Cited in

(6)

• On extendability of co-edge-regular graphs
• On extendability of Deza graphs with diameter 2
• On the extendability of quasi-strongly regular graphs with diameter 2
• The extendability of Cayley graphs generated by transpositions
• On the fractional matching extendability of Cayley graphs of abelian groups
• Eigenvalues and factors: a survey

This page was built for publication: The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668067)