Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"subcubic graphs"”.
-
Independent Domination Of Subcubic Graphs
… all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of order n having minimum degree at least two is at most 3(n+1)/7, providing a sharp upper bound …
-
Extremal problems on special graph colorings
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-10-02 without embargo terms