On the public citation graph

A New Upper Bound on the Total Domination Number of a Graph

https://doi.org/10.37236/983
0 signed · 34 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/(sici)1097-0118(200005)34:1<9::aid-jgt2>3.0.co;2-oopenalex-snapshot
Total domination in graphs with minimum degree three
inferredcites →https://doi.org/10.1002/1097-0118(200009)35:1<21::aid-jgt3>3.0.co;2-fopenalex-snapshot
Graphs with large total domination number
inferredcites →https://doi.org/10.1002/jgt.20000openalex-snapshot
Some remarks on domination
inferredcites →https://doi.org/10.1002/net.3230100304openalex-snapshot
Total domination in graphs
inferredcites →https://doi.org/10.1007/bf01191201openalex-snapshot
Small transversals in hypergraphs
inferredcites →https://doi.org/10.1007/s00493-007-2020-3openalex-snapshot
Total domination of graphs and small transversals of hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90354-kopenalex-snapshot
Covering all cliques of a graph
inferredcites →https://doi.org/10.1016/s0167-5060(08)71043-4openalex-snapshot
Covering All Cliques of a Graph
inferredcites →https://doi.org/10.1201/9781315141428openalex-snapshot
Domination in graphs : advanced topics
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.20345openalex-snapshot
Total domination in 2‐connected graphs and in graphs with no induced 6‐cycles
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_4openalex-snapshot
Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_12openalex-snapshot
Total Domination and Graph Products
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_13openalex-snapshot
Graphs with Disjoint Total Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_14openalex-snapshot
Total Domination in Graphs with Diameter Two
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_15openalex-snapshot
Nordhaus–Gaddum Bounds for Total Domination
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_17openalex-snapshot
Variations of Total Domination
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_2openalex-snapshot
Properties of Total Dominating Sets and General Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_3openalex-snapshot
Complexity and Algorithmic Results
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_4openalex-snapshot
Total Domination in Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_5openalex-snapshot
Total Domination and Minimum Degree
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_6openalex-snapshot
Total Domination in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_7openalex-snapshot
Total Domination and Forbidden Cycles
inferred← citeshttps://doi.org/10.1007/s00010-025-01196-zopenalex-snapshot
Domination parameters and added matchings
inferred← citeshttps://doi.org/10.1007/s10878-020-00606-zopenalex-snapshot
More on limited packings in graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2011.01.011openalex-snapshot
Nordhaus–Gaddum bounds for total domination
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.008openalex-snapshot
Essential upper bounds on the total domination number
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.044openalex-snapshot
A survey of selected recent results on total domination in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112965openalex-snapshot
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.07.004openalex-snapshot
Total domination and the Caccetta–Häggkvist conjecture
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.2989/16073606.2021.1988002openalex-snapshot
A new lower bound on the total domination number of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4667openalex-snapshot
On total dominating sets in 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.