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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Erthygl |
| Iaith: | English |
| Cyhoeddwyd: |
Trường Đại học Đà Lạt
2023
|
| Mynediad Ar-lein: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/114425 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/830 |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|