Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the total restrained domination edge critical graphs

From MaRDI portal
Publication:5397262
Jump to:navigation, search

zbMATH Open1289.05352MaRDI QIDQ5397262FDOQ5397262

Zeinab Maleki, K. M. Koh, Benhaz Omoomi

Publication date: 19 February 2014





Recommendations

  • On the total restrained domination number of a graph
  • Results on total restrained domination in graphs
  • Total restrained domination in trees
  • Total restrained domination in graphs
  • Total restrained domination numbers of trees


zbMATH Keywords

treematchingedge covertotal restrained domination numbertotal restrained domination edge critical graphs


Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)



Cited In (2)

  • Results on total restrained domination in graphs
  • An upper bound for the total restrained domination number of graphs





This page was built for publication: On the total restrained domination edge critical graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5397262&oldid=20126329"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 01:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki