Defensive k-alliances in graphs

DOI10.1016/J.AML.2008.02.012zbMATH Open1163.05322DBLPjournals/appml/Rodriguez-VelazquezYS09arXivmath/0611180OpenAlexW1982894246WikidataQ57974419 ScholiaQ57974419MaRDI QIDQ1027474FDOQ1027474

Ismael G. Yero, Jose M. Sigarreta, Juan A. Rodríguez-Velázquez

Publication date: 29 June 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Abstract: Let $Gamma=(V,E)$ be a simple graph. For a nonempty set $XsubseteqV$, and a vertex $vinV$, $delt{a}_X(v)$ denotes the number of neighbors $v$ has in $X$. A nonempty set $SsubseteqV$ is a emph{defensive $k$-alliance} in $Gamma=(V,E)$ if $$ $forallvinS.$ The defensive $k$-alliance number of $Gamma$, denoted by $a_k(Gamma)$, is defined as the minimum cardinality of a defensive $k$-alliance in $Gamma$. We study the mathematical properties of $a_k(Gamma)$.

Full work available at URL: https://arxiv.org/abs/math/0611180

Recommendations

• On defensive alliances and line graphs
• Global defensive \(k\)-alliances in graphs
• Upper \(k\)-alliances in graphs
• Boundary defensive \(k\)-alliances in graphs
• scientific article; zbMATH DE number 5056647

zbMATH Keywords

line graphalgebraic connectivitygraph eigenvaluesalliances in graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Global defensive alliances in graphs
• On defensive alliances and line graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectral study of alliances in graphs
• Title not available (Why is that?)
• Offensive alliances in cubic graphs
• Global offensive alliances in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Offensive alliances in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (28)

• Title not available (Why is that?)
• Partitioning a graph into offensive \(k\)-alliances
• Title not available (Why is that?)
• On defensive alliance in zero-divisor graphs
• Saturated boundary \(k\)-alliances in graphs
• Partitioning a graph into defensive \(k\)-alliances
• k-STRONG DEFENSIVE ALLIANCES IN GRAPHS
• Global defensive sets in graphs
• Title not available (Why is that?)
• On the complement graph and defensive \(k\)-alliances
• Defensive alliance polynomial
• Aspects of upper defensive alliances
• Global defensive \(k\)-alliances in graphs
• Defensive alliances in graphs of bounded treewidth
• On global offensive \(k\)-alliances in graphs
• Boundary defensive \(k\)-alliances in graphs
• Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product
• Proportionally dense subgraph of maximum size: complexity and approximation
• On defensive alliances and line graphs
• On global defensive k-alliances in zero-divisor graphs of finite commutative rings
• Global defensive k-alliances in directed graphs: combinatorial and computational issues
• Alliances and Related Domination Parameters
• Global defensive alliances in the lexicographic product of paths and cycles
• Title not available (Why is that?)
• Alliances in graphs: parameters, properties and applications -- a survey
• Offensive \(r\)-alliances in graphs
• Alliance free and alliance cover sets
• Partitioning a graph into global powerful \(k\)-alliances

This page was built for publication: Defensive \(k\)-alliances in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027474)