Skip to main content
Log in

On the Extendability of Quasi-Strongly Regular Graphs with Diameter 2

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Chan, O., Chen, C.C., Yu, Q.: On \(2\)-extendable abelian Cayley graphs. Discrete Math. 146, 19–32 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    MathSciNet  MATH  Google Scholar 

  3. Cioabă, S.M., Li, W.: The extendability of matchings in strongly regular graphs. Electron. J. Comb. 21, P2.34 (2014)

    MathSciNet  MATH  Google Scholar 

  4. Cioabă, S.M., Koolen, J., Li, W.: Max-cut and extendability of matchings in distance-regular graphs. Eur. J. Comb. 62, 232–244 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2010)

    Google Scholar 

  6. Erdös, P., Fajtlowicz, S., Hoffman, A.J.: Maximum degree in graphs of diameter 2. Networks 10, 87–90 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  7. Goldberg, F.: On quasi-strongly regular graphs. Linear Multilinear Algebra 54, 437–451 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hoffmann, A., Volkmann, L.: On regular factors in regular graphs with small radius. Electron. J. Comb. 11, R7 (2004)

    MathSciNet  MATH  Google Scholar 

  9. Holton, D.A., Lou, D.: Matching extensions of strongly regular graphs. Australas. J. Comb. 6, 187–208 (1992)

    MathSciNet  MATH  Google Scholar 

  10. Kawarabayashi, K., Ota, K., Saito, A.: Hamiltonian cycles in \(n\)-extendable graphs. J. Graph Theory 40(2), 75–82 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lou, D., Zhu, Q.: The \(2\)-extendability of strongly regular graphs. Discrete Math. 148, 133–140 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Miklavič, Š., Šparl, P.: On extendability of Cayley graphs. Filomat 23, 93–101 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Miklavič, Š., Šparl, P.: On extendability of Deza graphs with diameter 2. Discrete Math. 338, 1416–1423 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Plummer, M.D.: On \(n\)-extendable graphs. Discrete Math. 31, 201–210 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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)

  16. Plummer, M.D.: Extending matchings in graphs: a survey. Discrete Math. 127, 277–292 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Volkmann, L.: On regular \((2, q)\)-extendable graphs. Ars Comb. 105, 53–64 (2012)

    MathSciNet  MATH  Google Scholar 

  18. Yu, Q.: Characterizations of various matching extensions in graphs. Australas. J. Comb. 7, 55–64 (1993)

    MathSciNet  MATH  Google Scholar 

  19. Zhang, Z., Lou, D., Zhang, X.: Notes on factor-criticality, extendibility and independence number. Ars Comb. 87, 139–146 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Štefko Miklavič.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-018-1908-6

Keywords

Navigation