On the public citation graph

On domination related concepts in Graph Theory

https://doi.org/10.1007/bfb0092276
0 signed · 65 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190030306openalex-snapshot
Graph‐theoretic parameters concerning domination, independence, and irredundance
inferredcites →https://doi.org/10.1002/net.3230070305openalex-snapshot
Towards a theory of domination in graphs
inferredcites →https://doi.org/10.1002/net.3230100304openalex-snapshot
Total domination in graphs
inferredcites →https://doi.org/10.1007/bfb0070359openalex-snapshot
Theory and Applications of Graphs
inferredcites →https://doi.org/10.1007/bfb0070371openalex-snapshot
Domination of undirected graphs — A survey
inferredcites →https://doi.org/10.1016/0012-365x(76)90026-1openalex-snapshot
Disjoint independent dominating sets in graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90037-6openalex-snapshot
Traversability and connectivity of the middle graph of a graph
inferredcites →https://doi.org/10.1016/0012-365x(78)90105-xopenalex-snapshot
On domination and independent domination numbers of a graph
inferredcites →https://doi.org/10.1016/0012-365x(81)90268-5openalex-snapshot
Contributions to the theory of domination, independence and irredundance in graphs
inferredcites →https://doi.org/10.1016/0097-3165(71)90051-3openalex-snapshot
On covering sets and error-correcting codes
inferredcites →https://doi.org/10.1016/s0021-9800(70)80083-7openalex-snapshot
Bottleneck extrema
inferredcites →https://doi.org/10.1016/s0167-5060(08)70492-8openalex-snapshot
Linear Separation of Dominating Sets in Graphs
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.1093/imamat/14.2.183openalex-snapshot
Two Bounds for the Domination Number of a Graph
inferredcites →https://doi.org/10.2140/pjm.1975.61.225openalex-snapshot
Relations between packing and covering numbers of a tree
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2317652openalex-snapshot
Introduction to Combinatorial Mathematics.
inferredcites →https://doi.org/10.2307/2333777openalex-snapshot
The Theory of Graphs and its Applications.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199905)31:1<29::aid-jgt4>3.0.co;2-gopenalex-snapshot
A semi-induced subgraph characterization of upper domination perfect graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150202openalex-snapshot
A characterization of domination perfect graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190180507openalex-snapshot
Set domination in graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190200313openalex-snapshot
An induced subgraph characterization of domination perfect graphs
inferred← citeshttps://doi.org/10.1002/net.3230150108openalex-snapshot
A compilation of relations between graph invariants
inferred← citeshttps://doi.org/10.1002/net.3230180304openalex-snapshot
Vertex domination‐critical graphs
inferred← citeshttps://doi.org/10.1002/net.3230250102openalex-snapshot
Sequences of graphical invariants
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_4openalex-snapshot
Domination in Graphs
inferred← citeshttps://doi.org/10.1007/bf01157434openalex-snapshot
Domination-complete graphs
inferred← citeshttps://doi.org/10.1007/bfb0073116openalex-snapshot
Equalities involving certain graphical distributions
inferred← citeshttps://doi.org/10.1007/s00454-008-9081-yopenalex-snapshot
Cores of Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s10878-019-00454-6openalex-snapshot
Graphs with equal domination and covering numbers
inferred← citeshttps://doi.org/10.1007/s10878-019-00481-3openalex-snapshot
Domination and matching in power and generalized power hypergraphs
inferred← citeshttps://doi.org/10.1007/s11227-006-0003-6openalex-snapshot
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
inferred← citeshttps://doi.org/10.1007/s12652-021-03370-yopenalex-snapshot
Analysis of double domination by using the concept of spherical fuzzy information with application
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90145-6openalex-snapshot
A note on total domination
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90349-mopenalex-snapshot
Chordal graphs and upper irredundance, upper domination and independence
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90351-hopenalex-snapshot
Domatically critical and domatically full graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90355-lopenalex-snapshot
Factor domination in graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90356-mopenalex-snapshot
The least point covering and domination numbers of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90316-topenalex-snapshot
On packing and covering numbers of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00373-qopenalex-snapshot
Nordhaus-Gaddum inequalities for domination in graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90151-1openalex-snapshot
The domatic number problem
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90031-ropenalex-snapshot
The weighted perfect domination problem
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90089-2openalex-snapshot
A linear algorithm for finding a minimum dominating set in a cactus
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90058-3openalex-snapshot
An extremal problem for edge domination insensitive graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00073-9openalex-snapshot
Well irredundant graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00138-4openalex-snapshot
The weighted perfect domination problem and its variants
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90110-4openalex-snapshot
On graphs with equal domination and covering numbers
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90163-5openalex-snapshot
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.009openalex-snapshot
Equality of domination and transversal numbers in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.039openalex-snapshot
Domination in intersecting hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.03.021openalex-snapshot
Conical and spherical graphs
inferred← citeshttps://doi.org/10.1016/j.matpr.2022.06.147openalex-snapshot
Inverse litact domination in graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00103-4openalex-snapshot
Characterization of graphs with equal domination and covering number
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71040-9openalex-snapshot
Domatically Critical and Domatically Full Graphs
inferred← citeshttps://doi.org/10.1080/08957340802558367openalex-snapshot
Using a Taxonomy of Differential Step Functioning to Improve the Interpretation of DIF in Polytomous Items: An Illustration
inferred← citeshttps://doi.org/10.1109/noms47738.2020.9110445openalex-snapshot
Bloom Filter-based Routing for Dominating Set-based Service-Centric Networks
inferred← citeshttps://doi.org/10.1137/0403045openalex-snapshot
The Domatic Number Problem in Interval Graphs
inferred← citeshttps://doi.org/10.1137/0605040openalex-snapshot
On the Algorithmic Complexity of Total Domination
inferred← citeshttps://doi.org/10.1186/s13660-026-03451-6openalex-snapshot
On the validity of Lovász’s inequality for induced star-perfect graphs
inferred← citeshttps://doi.org/10.21123/bsj.2023.8378openalex-snapshot
On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph
inferred← citeshttps://doi.org/10.21136/cmj.1996.127310openalex-snapshot
On $f$-domination number of a graph
inferred← citeshttps://doi.org/10.26713/cma.v12i1.1406openalex-snapshot
Generalized Arithmetic Graphs With Equal and Unequal Powers of Annihilator Domination Number
inferred← citeshttps://doi.org/10.54660/anfo.2022.3.6.25openalex-snapshot
Minimal equitable dominating graph
inferred← citeshttps://doi.org/10.5815/ijieeb.2013.04.07openalex-snapshot
The Split Domination in Product Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.