Abstract
Let \(\ell \) denote a non-negative integer and let \(\Gamma \) be a connected graph of even order at least \(2 \ell +2\). It is said that \(\Gamma \) is \(\ell \)-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 quasi-strongly regular with parameters \((n, k, \lambda ; \mu _1, \mu _2, \ldots , \mu _s)\), if it is a k-regular graph on n vertices, such that any two adjacent vertices have exactly \(\lambda \) common neighbours and any two distinct and non-adjacent vertices have exactly \(\mu _i\) common neighbours for some \(1 \le i \le s\). The grade of \(\Gamma \) is the number of indices \(1 \le i \le s\) for which there exist two distinct and non-adjacent vertices in \(\Gamma \) with \(\mu _i\) common neighbours. In this paper we study the extendability of quasi-strongly regular graphs of diameter 2 and grade 2. In particular, we classify the 2-extendable members of this class of graphs.
Similar content being viewed by others
References
Chan, O., Chen, C.C., Yu, Q.: On \(2\)-extendable abelian Cayley graphs. Discrete Math. 146, 19–32 (1995)
Chen, C.C., Liu, J., Yu, Q.: On the classification of 2-extendable Cayley graphs on dihedral groups. Australas. J. Comb. 6, 209–219 (1992)
Cioabă, S.M., Li, W.: The extendability of matchings in strongly regular graphs. Electron. J. Comb. 21, P2.34 (2014)
Cioabă, S.M., Koolen, J., Li, W.: Max-cut and extendability of matchings in distance-regular graphs. Eur. J. Comb. 62, 232–244 (2017)
Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2010)
Erdös, P., Fajtlowicz, S., Hoffman, A.J.: Maximum degree in graphs of diameter 2. Networks 10, 87–90 (1980)
Goldberg, F.: On quasi-strongly regular graphs. Linear Multilinear Algebra 54, 437–451 (2006)
Hoffmann, A., Volkmann, L.: On regular factors in regular graphs with small radius. Electron. J. Comb. 11, R7 (2004)
Holton, D.A., Lou, D.: Matching extensions of strongly regular graphs. Australas. J. Comb. 6, 187–208 (1992)
Kawarabayashi, K., Ota, K., Saito, A.: Hamiltonian cycles in \(n\)-extendable graphs. J. Graph Theory 40(2), 75–82 (2002)
Lou, D., Zhu, Q.: The \(2\)-extendability of strongly regular graphs. Discrete Math. 148, 133–140 (1996)
Miklavič, Š., Šparl, P.: On extendability of Cayley graphs. Filomat 23, 93–101 (2009)
Miklavič, Š., Šparl, P.: On extendability of Deza graphs with diameter 2. Discrete Math. 338, 1416–1423 (2015)
Plummer, M.D.: On \(n\)-extendable graphs. Discrete Math. 31, 201–210 (1980)
Plummer, M.D.: Matching extension in bipartite graphs. In: Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing, Congr. Numer., vol. 54, pp. 245–258 (1986)
Plummer, M.D.: Extending matchings in graphs: a survey. Discrete Math. 127, 277–292 (1994)
Volkmann, L.: On regular \((2, q)\)-extendable graphs. Ars Comb. 105, 53–64 (2012)
Yu, Q.: Characterizations of various matching extensions in graphs. Australas. J. Comb. 7, 55–64 (1993)
Zhang, Z., Lou, D., Zhang, X.: Notes on factor-criticality, extendibility and independence number. Ars Comb. 87, 139–146 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
Štefko Miklavič, Primož Šparl: Supported in part by “Agencija za raziskovalno dejavnost Republike Slovenije”, research program P1-0285 and research projects J1-4010 and J1-4021.
Rights and permissions
About this article
Cite this article
Alajbegović, H., Huskanović, A., Miklavič, Š. et al. On the Extendability of Quasi-Strongly Regular Graphs with Diameter 2. Graphs and Combinatorics 34, 711–726 (2018). https://doi.org/10.1007/s00373-018-1908-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-018-1908-6