Bibliographic Details
| Title: |
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two. |
| Authors: |
Koh, K.1, Song, Zi-Xia2 Zixia.Song@ucf.edu |
| Superior Title: |
Graphs & Combinatorics. Sep2013, Vol. 29 Issue 5, p1429-1441. 13p. |
| Subject Terms: |
*GRAPH theory, *SET theory, *SUBGRAPHS, *GRAPH connectivity, *GENERALIZATION, *MATHEMATICAL analysis, *NUMERICAL analysis |
| Abstract: |
The core G of a graph G is the subgraph of G induced by the vertices of maximum degree Δ( G). In this paper, we show that if G is a connected graph with Δ( G) ≤ 2 and $${\Delta(G)\ge\frac12(|V(G)|-1)}$$, then G is of class 2 if and only if G is overfull. Our result generalizes several results of Hilton and Zhao. [ABSTRACT FROM AUTHOR] |
|
Copyright of Graphs & Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |