Teresa W. Haynes

From MaRDI portal
Person:234392

Available identifiers

zbMath Open haynes.teresa-wDBLP79/1793WikidataQ29452675 ScholiaQ29452675MaRDI QIDQ234392

List of research outcomes





PublicationDate of PublicationType
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set2024-09-26Paper
Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set2024-06-26Paper
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set2024-05-29Paper
https://portal.mardi4nfdi.de/entity/Q61598742023-06-23Paper
Self-coalition graphs2023-05-23Paper
Unique minimum semipaired dominating sets in trees2022-12-02Paper
Nordhaus-Gaddum bounds for upper total domination2022-07-15Paper
Remembering Frank Harary2022-03-09Paper
Vertex sequences in graphs2022-03-09Paper
Paired domination in graphs2021-12-15Paper
Models of domination in graphs2021-12-15Paper
Alliances and Related Domination Parameters2021-12-14Paper
Domination in digraphs2021-12-14Paper
The upper domatic number of a graph2021-10-05Paper
Introduction to coalitions in graphs2021-09-01Paper
Upper bounds on the coalition number2021-07-12Paper
Construction of trees with unique minimum semipaired dominating sets2021-06-23Paper
Partitioning the vertices of a cubic graph into two total dominating sets2021-06-07Paper
Bounds on the semipaired domination number of graphs with minimum degree at least two2021-05-11Paper
Restrained domination in self-complementary graphs2021-02-10Paper
The transitivity of special graph classes2020-11-12Paper
Graphs with large Italian domination number2020-11-05Paper
Cover rubbling and stacking2020-09-10Paper
Perfect double Roman domination of trees2020-07-07Paper
Total domination cover rubbling2020-06-29Paper
Trees with unique minimum semitotal dominating sets2020-04-30Paper
Partitioning the vertices of a graph into a total dominating set and an independent dominating set.2019-12-18Paper
Paired-domination game played in graphs2019-11-08Paper
\(k\)-efficient partitions of graphs2019-11-08Paper
Bounds on cost effective domination numbers2019-10-15Paper
Partitioning the vertices of a graph into two total dominating sets2019-10-15Paper
From domination to coloring. Stephen Hedetniemi's graph theory and beyond2019-10-08Paper
An annotated glossary of graph theory parameters, with conjectures2019-06-12Paper
Graphs with large semipaired domination number2019-05-27Paper
Perfect Italian domination in trees2019-05-03Paper
Domination cover rubbling2019-05-03Paper
1-restricted optimal rubbling on graphs2019-02-07Paper
Client-server and cost effective sets in graphs2019-01-25Paper
Rainbow disconnection in graphs2018-08-10Paper
Perfect graphs involving semitotal and semipaired domination2018-07-20Paper
https://portal.mardi4nfdi.de/entity/Q45662262018-06-14Paper
Semipaired domination in graphs2018-06-14Paper
Distribution centers in graphs2018-05-24Paper
An introduction to \(t\)-restricted optimal rubbling2018-04-23Paper
Global domination edge critical graphs2018-02-23Paper
A polynomial time algorithm for downhill and uphill domination2018-02-23Paper
Domination parameters of a graph and its complement2018-01-10Paper
Mixed Roman domination in graphs2017-12-08Paper
https://portal.mardi4nfdi.de/entity/Q45952242017-11-29Paper
From connectivity to coloring2017-11-20Paper
Lower bounds on the roman and independent roman domination numbers2017-07-19Paper
Downhill and uphill domination in graphs2017-06-13Paper
Bounds on the Global Domination Number2017-03-20Paper
Connected domination stable graphs upon edge addition2017-03-20Paper
Roman and total domination2017-03-20Paper
Restricted optimal pebbling and domination in graphs2017-02-27Paper
All my favorite conjectures are critical2016-12-16Paper
On \(ve\)-degrees and \(ev\)-degrees in graphs2016-12-14Paper
A note on non-dominating set partitions in graphs2016-11-11Paper
Double Roman domination2016-11-02Paper
Very cost effective bipartitions in graphs2016-10-14Paper
Neighborhood-restricted \([\leq 2]\)-achromatic colorings2016-06-01Paper
Vertex-edge domination in graphs2016-05-18Paper
Roman \(\{2 \}\)-domination2016-04-07Paper
A Roman domination chain2016-03-02Paper
Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey2015-09-28Paper
Total domination edge critical graphs with total domination number three and many dominating pairs2015-09-24Paper
Bipartitions based on degree constraints2015-05-21Paper
Bounds on weak Roman and 2-rainbow domination numbers2014-09-12Paper
Improved bounds on the domination number of a tree2014-09-08Paper
A maximum degree theorem for diameter-2-critical graphs2014-08-29Paper
Independent \([1,k]\)-sets in graphs2014-08-15Paper
Downhill domination in graphs2014-07-28Paper
https://portal.mardi4nfdi.de/entity/Q54198622014-06-11Paper
A characterization of \(P_5\)-free, diameter-2-critical graphs2014-05-06Paper
\([1,2]\)-sets in graphs2014-04-23Paper
Bounds on the connected domination number of a graph2014-04-23Paper
https://portal.mardi4nfdi.de/entity/Q54054482014-04-02Paper
Graphs and their complements with equal total domination numbers2014-03-12Paper
Total domination in graphs with diameter 22014-01-28Paper
Cost effective domination in graphs2014-01-03Paper
Liar's domination in ladders2014-01-03Paper
Equivalence domination in graphs2013-11-19Paper
Domination edge lift critical trees2013-11-19Paper
Independent domination in complementary prisms2013-11-11Paper
Double domination in complementary prisms2013-11-11Paper
Global domination stable trees2013-06-25Paper
Edge lifting and total domination in graphs2013-04-08Paper
Relating the annihilation number and the total domination number of a tree2013-01-18Paper
Effects of edge lifting on domination in graphs2012-10-06Paper
A characterization of diameter-2-critical graphs whose complements are diamond-free2012-08-10Paper
Restrained domination in complementary prisms2012-07-02Paper
A characterization of diameter-2-critical graphs with no antihole of length four2012-05-31Paper
Erratum to ``Total domination supercritical graphs with respect to relative complements [Discrete Math. 258 (2002) 361-371]2012-03-16Paper
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free2012-03-07Paper
On a conjecture of Murty and Simon on diameter two critical graphs. II.2012-01-11Paper
https://portal.mardi4nfdi.de/entity/Q31055462012-01-05Paper
Total domination changing and stable graphs upon vertex removal2011-10-27Paper
On a conjecture of Murty and Simon on diameter 2-critical graphs2011-08-09Paper
Upper bounds on the total domination number2011-06-29Paper
An extremal problem for total domination stable graphs upon edge removal2011-06-28Paper
Total domination dot-stable graphs2011-06-28Paper
Global defensive alliances in trees2011-05-31Paper
Maximal independent sets in minimum colorings2011-05-31Paper
On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs2011-05-31Paper
Double domination stable graphs upon edge removal2011-04-18Paper
Vertex-edge domination2010-12-08Paper
\(k\)-independence stable graphs upon edge removal2010-12-08Paper
Global offensive alliance numbers in graphs with emphasis on trees2010-12-08Paper
Total domination stable graphs upon edge addition2010-11-19Paper
Total domination critical and stable graphs upon edge removal2010-11-05Paper
Locating-domination in complementary prisms of paths and cycles2010-09-02Paper
Locating-domination in complementary prisms2010-06-17Paper
Bounds on the global offensive \(k\)-alliance number in graphs2010-05-14Paper
A dedication to Professor Gary Chartrand2009-12-15Paper
A survey of stratified domination in graphs2009-12-15Paper
Using a neural network to identify secondary RNA structures quantified by graphical invariants2009-12-03Paper
Domination and total domination in complementary prisms2009-09-02Paper
Powerful alliances in graphs2009-06-19Paper
https://portal.mardi4nfdi.de/entity/Q36261832009-05-22Paper
Irredundant colorings of graphs2009-04-21Paper
Ratios of some domination parameters in trees2008-07-11Paper
Global alliances and independence in trees2008-02-22Paper
The complementary product of two graphs2008-02-15Paper
The alliance partition number of grid graphs2008-02-05Paper
https://portal.mardi4nfdi.de/entity/Q34286602007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34286402007-03-29Paper
A note on the total domination number of a tree2007-02-15Paper
Trees with large paired-domination number2007-02-08Paper
Independent and double domination in trees2006-12-12Paper
Trees with equal domination and paired-domination numbers.2006-10-16Paper
Differentials in graphs2006-09-14Paper
Characterizations of trees with equal paired and double domination numbers2006-09-14Paper
Locating and total dominating sets in trees2006-06-30Paper
On the codomination number of a graph2006-03-23Paper
Bicritical domination2006-01-10Paper
Broadcasts in graphs2006-01-10Paper
Trees with two disjoint minimum independent dominating sets2005-12-29Paper
https://portal.mardi4nfdi.de/entity/Q54660502005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54635062005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54634622005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54616972005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54615472005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54616902005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54616832005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54614512005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54608822005-07-20Paper
Induced-paired domination in graphs.2005-07-20Paper
Total and paired-domination numbers of a tree2005-05-03Paper
Total domination subdivision numbers of graphs2005-04-19Paper
Hereditary domination and independence parameters2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46623522005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q46623472005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q46623432005-03-30Paper
The diameter of total domination vertex critical graphs2004-11-22Paper
Total domination subdivision numbers of trees2004-11-22Paper
Geodetic Achievement and Avoidance Games For Graphs2004-10-15Paper
https://portal.mardi4nfdi.de/entity/Q44702372004-06-22Paper
Global defensive alliances in graphs2004-02-05Paper
Changing and unchanging domination: A classification2003-12-04Paper
Stratification and domination in graphs2003-11-25Paper
Trees with unique minimum total dominating sets2003-11-17Paper
https://portal.mardi4nfdi.de/entity/Q44059242003-09-30Paper
https://portal.mardi4nfdi.de/entity/Q44057702003-08-21Paper
\(H\)-forming sets in graphs2003-04-28Paper
Total Domination Edge Critical Graphs with Maximum Diameter2003-03-18Paper
Strong equality of domination parameters in trees2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q47805262003-02-04Paper
Domination in Graphs Applied to Electric Power Networks2003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q44439332003-01-01Paper
Total irredundance in graphs2002-12-02Paper
Total domination supercritical graphs with respect to relative complements2002-12-02Paper
Domination Subdivision Numbers2002-11-05Paper
https://portal.mardi4nfdi.de/entity/Q45521962002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45522252002-08-29Paper
Paired-domination in graphs2002-07-21Paper
Trees with equal domination and tree-free domination numbers2002-07-03Paper
https://portal.mardi4nfdi.de/entity/Q45293132002-06-24Paper
A characterization of \(i\)-excellent trees2002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45294952002-05-22Paper
Domination and independence subdivision numbers of graphs2002-03-24Paper
Generalized maximum degree2001-11-28Paper
Strong equality of upper domination and independence in trees2001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q49497942001-10-03Paper
A generalization of domination critical graphs2001-07-09Paper
https://portal.mardi4nfdi.de/entity/Q45266232001-05-10Paper
https://portal.mardi4nfdi.de/entity/Q45049012001-04-26Paper
Extremal graphs for inequalities involving domination parameters2001-02-05Paper
https://portal.mardi4nfdi.de/entity/Q45048912001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q44874582000-11-19Paper
https://portal.mardi4nfdi.de/entity/Q44892432000-09-25Paper
https://portal.mardi4nfdi.de/entity/Q45048862000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q49535522000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49435182000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49339352000-01-17Paper
On perfect neighborhood sets in graphs2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42282291999-08-19Paper
https://portal.mardi4nfdi.de/entity/Q42282261999-08-10Paper
https://portal.mardi4nfdi.de/entity/Q42220751998-12-06Paper
https://portal.mardi4nfdi.de/entity/Q43933141998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43786391998-08-31Paper
https://portal.mardi4nfdi.de/entity/Q38382071998-08-09Paper
https://portal.mardi4nfdi.de/entity/Q43933041998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43906241998-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43906501998-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43877161998-05-13Paper
https://portal.mardi4nfdi.de/entity/Q43467861998-02-01Paper
https://portal.mardi4nfdi.de/entity/Q43510811998-01-19Paper
https://portal.mardi4nfdi.de/entity/Q43687281997-12-08Paper
On graphs having equal domination and codomination numbers1997-07-20Paper
https://portal.mardi4nfdi.de/entity/Q52840561997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q52840341997-03-09Paper
https://portal.mardi4nfdi.de/entity/Q52840321997-03-09Paper
Nordhaus-Gaddum inequalities for domination in graphs1997-02-17Paper
Invariants of E-graphs1996-09-16Paper
https://portal.mardi4nfdi.de/entity/Q48622211996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48634651996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q43091471995-01-04Paper
https://portal.mardi4nfdi.de/entity/Q43044251994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q31392741994-04-25Paper
Applications of E-graphs in network design1993-12-20Paper
Extremal graphs domination insensitive to the removal of \(k\) edges1993-11-28Paper
https://portal.mardi4nfdi.de/entity/Q40243351993-03-09Paper
Theg-network and its inherent fault tolerant properties1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39832411992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39845301992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q34721281990-01-01Paper

Research outcomes over time

This page was built for person: Teresa W. Haynes