Please use this identifier to cite or link to this item:
Title: Nessary and sufficient conditions for quasi-strong regularity of graph product
Authors: Do, Minh Tuan
Vu, Dinh Hoa
Keywords: Quasi-strongly regular graph
Product graph
Issue Date: 2018
Series/Report no.: Journal of Computer Science and Cybernetics;Vol. 34, No. 02 .- P.161–169
Abstract: A k-regular graph (k ≥ 1) with n vertices is called a quasi-strongly regular graph with parameter λ (λ € N) if any two adjacent vertices have exactly λ neighbors in common. A graph product is a binary operation on graphs. It is useful to describe graph as product of other primitive graphs. In this paper we present some necessary and sufficient conditions for Decartes product. Tensor product, Lexicographical product and Strong product to be quasi-strongly regular.
ISSN: 1813-9663
Appears in Collections:Tin học và Điều khiển học (Journal of Computer Science and Cybernetics)

Files in This Item:
File Description SizeFormat 
  Restricted Access
3.44 MBAdobe PDF
Your IP:

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.