Towards a new framework for domination

DOI10.1016/J.CAMWA.2011.04.038MaRDI QIDQ651449zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 18 December 2011

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://idus.us.es/xmlui/handle/11441/38743

zbMATH Keywords

digital convexityHelly numberdomination chain

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Helly-type theorems and geometric transversal theory (52A35)

Recommendations

• scientific article; zbMATH DE number 2204178
• scientific article; zbMATH DE number 1124598
• scientific article; zbMATH DE number 1095171
• scientific article; zbMATH DE number 437472
• Outer-weakly convex domination number of graphs

Cites work

• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302196 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A linear algorithm for the domination number of a tree
• Boundary vertices in graphs
• Classes of discrete convexity properties
• Closure systems and their structure
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On the computation of the hull number of a graph
• Properties of Hereditary Hypergraphs and Middle Graphs
• Rebuilding convex sets in graphs
• Sequential Operations in Digital Picture Processing
• Some remarks on the geodetic number of a graph
• Stratification and domination in graphs
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Towards a theory of domination in graphs
• Two relations between the parameters of independence and irredundance

Cited in

(9)

• Preserving dominance relations through disaggregation: the evil and the saint
• The diversity of domination
• Generating and enumerating digitally convex sets of trees
• Reconstructing trees from digitally convex sets
• Topics on domination
• Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
• Critical concepts in domination
• Iterated dominance revisited
• An inner model for global domination

This page was built for publication: Towards a new framework for domination

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