Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
Exact defensive alliances in graphs
Article
Carballosa, W. (2013). Exact defensive alliances in graphs .
7(73-76), 3673-3679. 10.12988/ams.2013.35244
Share this citation
Twitter
Email
Carballosa, W. (2013). Exact defensive alliances in graphs .
7(73-76), 3673-3679. 10.12988/ams.2013.35244
Copy Citation
Share
Overview
Identifiers
Additional Document Info
View All
Overview
cited authors
Carballosa, W
authors
Carballosa Torres, Walter
abstract
A nonempty set S ⊂ V is a defensive k-alliance in G = (V,E), k ∈ [-Δ, Δ] ∪ Z, if for every v ∈ S, dS(v) ≥ dS̄(v)+ k. A defensive k-alliance S is called exact, if S is defensive k-alliance but is no defensive (k+1)-alliance in G. In this paper we study the mathematical properties of exact defensive k-alliances in graphs. In particular, we obtain several bounds for defensive k-alliance of a graph. Furthermore, we characterize the exact defensive alliances in graph join G1 G2 in terms of G1, G2. © 2013 Walter Carballosa.
publication date
July 31, 2013
Identifiers
Digital Object Identifier (DOI)
https://doi.org/10.12988/ams.2013.35244
Additional Document Info
start page
3673
end page
3679
volume
7
issue
73-76