Defensive k-alliances in graphs

DOI10.1016/J.AML.2008.02.012MaRDI QIDQ1027474zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 29 June 2009

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

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

zbMATH Keywords

line graphalgebraic connectivitygraph eigenvaluesalliances in graphs

Mathematics Subject Classification ID

Connectivity (05C40)

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)$.

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

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 1933255 (Why is no real title available?)
• scientific article; zbMATH DE number 2076807 (Why is no real title available?)
• scientific article; zbMATH DE number 2077650 (Why is no real title available?)
• scientific article; zbMATH DE number 2170476 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• scientific article; zbMATH DE number 5056647 (Why is no real title available?)
• Global defensive alliances in graphs
• Global offensive alliances in graphs
• Offensive alliances in cubic graphs
• Offensive alliances in graphs
• On defensive alliances and line graphs
• Spectral study of alliances in graphs

Cited in

(30)

• Partitioning a graph into offensive k-alliances
• scientific article; zbMATH DE number 6475954 (Why is no real title available?)
• scientific article; zbMATH DE number 6843424 (Why is no real title available?)
• On defensive alliance in zero-divisor graphs
• Saturated boundary \(k\)-alliances in graphs
• Partitioning a graph into defensive \(k\)-alliances
• Computing the strong alliance polynomial of a graph
• k-STRONG DEFENSIVE ALLIANCES IN GRAPHS
• Global defensive sets in graphs
• scientific article; zbMATH DE number 5777940 (Why is no real title available?)
• On the complement graph and defensive \(k\)-alliances
• Defensive alliance polynomial
• Aspects of upper defensive alliances
• Defensive alliances in circulant graphs.
• 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
• Upper \(k\)-alliances in graphs
• 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
• Alliances in graphs: parameters, properties and applications -- a survey
• Offensive \(r\)-alliances in graphs
• Partitioning a graph into global powerful \(k\)-alliances
• Alliance free and alliance cover sets

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)