On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
From MaRDI portal
Publication:394539
DOI10.1016/j.disc.2013.12.013zbMath1281.05102OpenAlexW2033747178MaRDI QIDQ394539
David Amos, Randy Davila, Ryan Pepper
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.12.013
Related Items (5)
Graphs with the strong Havel-Hakimi property ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ MAX for \(k\)-independence in multigraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with equal independence and annihilation numbers
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- Lower bounds on the independence number in terms of the degrees
- New approach to the \(k\)-independence number of a graph
- Bounds on the \(k\)-domination number of a graph
- On \(k\)-domination and \(j\)-independence in graphs
- Degree Sequence Index Strategy
- Functigraphs: An extension of permutation graphs
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the residue of a graph
- Improved lower bounds on k‐independence
- Degree sequences of graphs and dominance order
- Reducibility among Combinatorial Problems
This page was built for publication: On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
