THE STRUCTURE OF GRAPHS ON n VERTICES WITH THE DEGREE SUM OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2
Let G be an undirected simple graph on n vertices and sigma2(G)=n-2 (degree sum of any two non-adjacent vertices in G is equal to n-2) and alpha(G) be the cardinality of an maximum independent set of G. In G, a vertex of degree (n-1) is called total vertex. We show that, for n>=3 is an odd number...
Saved in:
Main Author: | Do, Nhu An |
---|---|
Format: | Article |
Language: | English |
Published: |
Trường Đại học Đà Lạt
2023
|
Online Access: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/114425 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/830 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institutions: | Thư viện Trường Đại học Đà Lạt |
---|
Similar Items
-
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: Do, Nhu An, et al.
Published: (2024) -
Vertical and Horizontal /
by: Ross, Lillian.
Published: (1963) -
Vertical Scar Mammaplasty
by: Hamdi, Moustapha
Published: (2020) -
Vertical patterns of nitrogen transformations during infiltration in two wetland soils /
by: Davidsson, T. E. -
Vertical integration in the oil industry
by: Mitchell, Edward J.
Published: (1974)