Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the difference of the domination number of a digraph and of its reverse

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

DOI10.1016/j.dam.2011.12.029zbMath1242.05202OpenAlexW2050629044MaRDI QIDQ423949

Štefan Gyürki

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.029


zbMATH Keywords

directed graphdomination numbertotal domination numberconversereverse digraph


Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)


Related Items (5)

A note on Roman domination of digraphs ⋮ Double Roman domination in digraphs ⋮ Domination in Digraphs ⋮ Delta invariant for Eulerian digraphs ⋮ Bounds on the domination number of a digraph and its reverse



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Domination in a digraph and in its reverse
  • On the out-domination and in-domination numbers of a digraph
  • Database Theory - ICDT 2005




This page was built for publication: On the difference of the domination number of a digraph and of its reverse

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:423949&oldid=12298064"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki