Necessary and sufficient conditions for quasi-strongly regularity of Graph Product

Tuan Minh Do, Hoa Dinh Vu
Author affiliations

Authors

  • Tuan Minh Do Department of Natural Sciences, Nam Dinh Teacher Training College, PhD Student in VNU, Hanoi University of Science
  • Hoa Dinh Vu Department of Information Technology, Hanoi University of Education

DOI:

https://doi.org/10.15625/1813-9663/34/2/12489

Keywords:

quasi-strongly regular graph, product graph

Abstract

A $k$-regular graph ($k\ge 1$) with $n$ vertices is called a quasi-strongly regular graph with parameter $\lambda$ ($\lambda\in\NN$) if any two adjacent vertices have exactly $\lambda$ neighbors in common.A graph product is a binary operation on graphs. In this paper we prove some necessary and sufficient conditions for Decartes Product, Tensor Product, Lexicographical product and Strong product to be quasi-strongly regular.

Metrics

Metrics Loading ...

References

Azarija, J. & Tilen Marc, {it There is no (75,32,10,16) strongly regular graph}, arXiv:1509.05933, Dec. 2015.

Azarija, J. & Tilen Marc,

There is no (95,40,12,20) strongly regular graph, arXiv:1603.02032, Mar. 2016.

Behbahani, M. & Clement Lam,

{it Strongly regular graphs with non-trivial automorphisms}, Discr. Math. 311, p. 132-144, 2011.

Bondarenko, Andriy V. & Danylo V. Radchenko,

{it On a family of strongly regular graphs with $lambda = 1$}, arXiv:1201.0383, Feb. 2012.

Bondarenko, A. V., Prymak, A. & Radchenko, D.

{it Non-existence of (76,30,8,14) strongly regular graph and some structural tools}, arXiv:1410.6748, Oct. 2014.

Bondarenko, A. V., Mellit, A., Prymak, A. , Radchenko, D. & Viazovska, M. {it There is no strongly regular graph with parameters (460,153,32,60)}, arXiv:1509.06286, Sep. 2015.

Beineke, L.W. and Wilson, R. J. (Eds.) {it Topics in Algebraic Graph Theory}, Newyork; Cambridge University, p.104, 2004.

Goldberg, F. {it On quasi-strongly regular graphs}, Linear and Multilinear Algebra , Volume 54 - Issue 6,

p. 437-451, 2006.

Vizing, V.G. {it The Cartesian product of graphs}, Vyc. Sis. 9, 30-43, (1963).

Wilfried, I. & Klavar, Sandi. {it Product Graphs: Structure and Recognition}. Wiley. ISBN 0-471-37039-8{{inconsistent citations}}, 2000.

url{http://www.maths.gla.ac.uk/~es/srgraphs.php}

Downloads

Published

03-10-2018

How to Cite

[1]
T. M. Do and H. D. Vu, “Necessary and sufficient conditions for quasi-strongly regularity of Graph Product”, JCC, vol. 34, no. 2, pp. 161–169, Oct. 2018.

Issue

Vol. 34 No. 2 (2018)

Section

Computer Science

License

1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.
2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
Crossref
Scopus
Google Scholar
Europe PMC