On the k-residue of disjoint unions of graphs with applications to k-independence

DOI10.1016/J.DISC.2013.12.013MaRDI QIDQ394539zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

independence\(k\)-independenceresidue\(k\)-residuedisjoint union lemmafunction graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• k-Independence and thek-residue of a graph
• Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
• New approach to the \(k\)-independence number of a graph
• New results on \(k\)-independence of graphs
• Havel-Hakimi residues of unigraphs

Cites work

• scientific article; zbMATH DE number 4173029 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1557063 (Why is no real title available?)
• scientific article; zbMATH DE number 2544 (Why is no real title available?)
• scientific article; zbMATH DE number 3999967 (Why is no real title available?)
• scientific article; zbMATH DE number 4121429 (Why is no real title available?)
• scientific article; zbMATH DE number 3304760 (Why is no real title available?)
• A remark on the existence of finite graphs
• Bounds on the \(k\)-domination number of a graph
• Degree sequence index strategy
• Degree sequences of graphs and dominance order
• Functigraphs: An extension of permutation graphs
• Graphs with equal independence and annihilation numbers
• Implications of some observations about the \(k\)-domination number
• Improved lower bounds on k‐independence
• Independence in function graphs
• Lower bounds on the independence number in terms of the degrees
• New approach to the \(k\)-independence number of a graph
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On \(k\)-domination and \(j\)-independence in graphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• On the residue of a graph
• Reducibility among combinatorial problems
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(8)

• Conjectures of TxGraffiti: independence, domination, and matchings
• On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
• Upper bounds on the \(k\)-forcing number of a graph
• k-Independence and thek-residue of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• Havel-Hakimi residues of unigraphs
• Graphs with the strong Havel-Hakimi property
• MAX for \(k\)-independence in multigraphs

Describes a project that uses

Uses Software

• GRAFFITI

This page was built for publication: On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence

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