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...
में बचाया:
मुख्य लेखक: | Do, Nhu An |
---|---|
स्वरूप: | लेख |
भाषा: | English |
प्रकाशित: |
Trường Đại học Đà Lạt
2023
|
ऑनलाइन पहुंच: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/114425 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/830 |
टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
समान संसाधन
-
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
द्वारा: Do, Nhu An, और अन्य
प्रकाशित: (2024) -
Vertical and Horizontal /
द्वारा: Ross, Lillian.
प्रकाशित: (1963) -
Vertical Scar Mammaplasty
द्वारा: Hamdi, Moustapha
प्रकाशित: (2020) -
Vertical patterns of nitrogen transformations during infiltration in two wetland soils /
द्वारा: Davidsson, T. E. -
Vertical integration in the oil industry
द्वारा: Mitchell, Edward J.
प्रकाशित: (1974)