Graphs with maximum size and given paired-domination number
From MaRDI portal
Publication:2449089
DOI10.1016/j.dam.2014.01.019zbMath1288.05193OpenAlexW2002597062MaRDI QIDQ2449089
John J. McCoy, Michael A. Henning, Justin Southey
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.01.019
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paired-domination in claw-free cubic graphs
- Graphs with large paired-domination number
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Paired-domination number of a graph and its complement
- Upper bounds on the paired-domination number
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Paired-domination in \(P_{5}\)-free graphs
- Paired-domination of trees
- Maximum sizes of graphs with given domination parameters
- Relating the size of a connected graph to its total and restricted domination numbers
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”
- Relationships between total domination, order, size, and maximum degree of graphs
- The diameter of paired-domination vertex critical graphs
- Paired-domination
- A linear vizing-like relation between the size and the domination number of a graph
- Paired-domination in graphs
- A linear Vizing‐like relation relating the size and total domination number of a graph
This page was built for publication: Graphs with maximum size and given paired-domination number
