Skip to main content
Log in

On Generalized Strongly Regular Graphs

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

Abstract

A generalized strongly regular graph of grade p, as a generalization of strongly regular graphs, is a regular graph such that the number of common neighbours of both any two adjacent vertices and any two non-adjacent vertices takes on p distinct values. In this paper, we study generalized strongly regular graphs of grade 2 and provide some inequalities for the eigenvalues of them. In particular, we investigate a special family of generalized strongly regular graphs of grade 2, i.e., semi-strongly regular graphs. We obtain a relation between the parameters and two inequalities for the eigenvalues of these graphs. We also present some constructions of generalized strongly regular graphs based on Cayley graphs, graph operations and association schemes, respectively.

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. Bailey, R.A.: Association Schemes: Designed Experiments, Algebra and Combinatorics. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  2. Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. The Benjamin/Cummings, Menlo Park (1984)

    MATH  Google Scholar 

  3. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, Berlin (1989)

    Book  MATH  Google Scholar 

  4. Brouwer, A.E., Haemers, W.H.: Spectra of Graphs, Universitext. Springer, New York (2012)

    Book  MATH  Google Scholar 

  5. Erickson, M., Fernando, S., Haemers, W.H., Hardy, D., Hemmeter, J.: Deza graph: a generalization of stongly regular graphs. J. Combin. Des. 7(6), 395–405 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, New York (2001)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Golightly, W., Haynworth, W., Sarvate, D.G.: A family of connected quasi-strongly regular graph. Congr. Numer. 124, 89–95 (1997)

    MathSciNet  MATH  Google Scholar 

  9. Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)

    Book  MATH  Google Scholar 

  10. Huo, L., Zhang, G.: Subconstituents of the orthogonal graph of type \((m, m-1,0)\) of odd characteristic. Linear Algebra Appl. 524, 1–12 (2017)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referees and editors for their valuable suggestions which have helped improve this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gengsheng Zhang.

Additional information

This research is partially supported by National Natural Science Foundation of China (Grant No. 11571091), Natural Science Foundation of Hebei Education Department (Grant No. ZD2016096) and Natural Science Foundation of Hebei Normal University (Grant No. L2015Z02).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jia, D., Yuan, L. & Zhang, G. On Generalized Strongly Regular Graphs. Graphs and Combinatorics 34, 555–570 (2018). https://doi.org/10.1007/s00373-018-1894-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-018-1894-8

Keywords

Mathematics Subject Classification

Navigation