4-REGULAR GRAPH OF DIAMETER 2
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...
Saved in:
Main Authors: | Đỗ Như An, Nguyễn Đình Ái |
---|---|
Format: | Article |
Language: | English |
Published: |
Dalat University
2013-06-01
|
Series: | Tạp chí Khoa học Đại học Đà Lạt |
Subjects: | |
Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/245 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$
by: Reimbay Reimbayev
Published: (2024-08-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01) -
THE STRUCTURE OF GRAPHS ON \(n\) VERTICES WITH THE DEGREE SUM OF ANY TWO NONADJACENT VERTICES EQUAL TO \(n-2\)
by: Do Nhu An
Published: (2021-10-01) -
On certain regular graphs of girth 5
by: M. O'keefe, et al.
Published: (1984-01-01) -
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01)