Degree Sequences and Secure Domination Variants in Connected Graphs of Order at Most Five
Mathematics for Applications · 30.01.2026 · 15 (1) · 152-176
DOI: 10.66838/ma.229 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics for Applications, online erschienen am 30.01.2026. Verfasst von RAYAPROLU VISWA PRASAD und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Secure domination models a movable guard system: every unoccupied vertex must have a neighboring guard that can move to it without destroying the required protection. This paper gives a complete, graph-by-graph classification of the secure domination number, secure total domination number, and secure connected domination number for every connected non-isomorphic simple graph of order from two through five. The corpus contains exactly thirty graphs: one of order two, two of order three, six of order four, and twenty-one of order five. For each graph, the paper records a labeled diagram, edge set, nonincreasing degree sequence, a representative minimum secure set for each variant, the three parameter values, and an explicit defender certificate. The values were obtained by exhaustive subset enumeration and reproduced by an independently written bitset implementation. The classification yields ninety exact parameter values. Four complete graphs satisfy ; four noncomplete graphs satisfy ; and the remaining twenty-two graphs satisfy . Thus, among noncomplete connected graphs of order at most five, secure total and secure connected domination coincide throughout the census. The thirty graphs realize twenty-eight-degree sequences. The two repeated degree sequences occur in non-isomorphic pairs, but each pair has the same parameter triple; consequently, the degree sequence determines the triple within this finite corpus, although not in general. General results proved in the paper include the basic parameter inequalities, the ordering for noncomplete connected graphs, exact values for complete graphs and stars, and a characterization of graphs with . The resulting article is intended as a transparent small-order reference, a source of worked examples, and a verified base for later structural conjectures.
Zitieren
APA
PRASAD, R. V., & SRINIVASARAO, K. (2026). Degree Sequences and Secure Domination Variants in Connected Graphs of Order at Most Five. Mathematics for Applications, 15(1), 152-176. https://doi.org/10.66838/ma.229
Vancouver
PRASAD RV, SRINIVASARAO K. Degree Sequences and Secure Domination Variants in Connected Graphs of Order at Most Five. Mathematics for Applications. 2026;15(1):152-176. doi:10.66838/ma.229
BibTeX
@article{PRASAD2026,
author = {PRASAD, RAYAPROLU VISWA and SRINIVASARAO, KONDA},
title = {Degree Sequences and Secure Domination Variants in Connected Graphs of Order at Most Five},
journal = {Mathematics for Applications},
year = {2026},
volume = {15},
number = {1},
pages = {152--176},
doi = {10.66838/ma.229}
}
EUVIMED