Towards a new framework for domination

DOI10.1016/j.camwa.2011.04.038zbMath1228.05223OpenAlexW2049601479MaRDI QIDQ651449

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

Helly numberdigital convexitydomination chain

Mathematics Subject Classification ID

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

Related Items

Generating and enumerating digitally convex sets of trees, Reconstructing trees from digitally convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of discrete convexity properties
• Some remarks on the geodetic number of a graph
• On the computation of the hull number of a graph
• Two relations between the parameters of independence and irredundance
• A linear algorithm for the domination number of a tree
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Stratification and domination in graphs
• Closure systems and their structure
• Boundary vertices in graphs
• Rebuilding convex sets in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Towards a theory of domination in graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• Sequential Operations in Digital Picture Processing