4-REGULAR GRAPH OF DIAMETER 2
DOI:
https://doi.org/10.37569/DalatUniversity.3.2.245(2013)Keywords:
Regular graph, Strongly regular graph, Diameter of graph.Abstract
A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k. Let G be a graph, the distance between two vertices in G is the number of edges in a shortest path connecting them. The diameter of G is the greatest distance between any pair of vertices. Let n4 be maximum integer number so that there exists an 4-regular graph on n4 vertices of diameter 2. We prove that n4 = 15.Downloads
Download data is not yet available.
Published
30-06-2013
Volume and Issues
Section
Natural Sciences and Technology
Copyright & License
Copyright (c) 2013 Đỗ Như An, Nguyễn Đình Ái
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
How to Cite
An, Đỗ N., & Ái, N. Đình. (2013). 4-REGULAR GRAPH OF DIAMETER 2. Dalat University Journal of Science, 3(2), 5-11. https://doi.org/10.37569/DalatUniversity.3.2.245(2013)
