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

Minimum dominating set of circular-arc overlap graphs

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

zbMATH Open1219.05126MaRDI QIDQ3079741FDOQ3079741


Authors: B. Maheswari, A. Sudhakaraiah, L. Nagamuni Reddy, Y. Lakshmi Naidu Edit this on Wikidata


Publication date: 2 March 2011





Recommendations

  • Dominating sets and domatic number of circular arc graphs
  • scientific article; zbMATH DE number 6119094
  • Linear time algorithms on circular-arc graphs
  • The complexity of domination problems in circle graphs
  • Total domination in circular-arc graphs


Mathematics Subject Classification ID

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



Cited In (2)

  • Global domination
  • Title not available (Why is that?)





This page was built for publication: Minimum dominating set of circular-arc overlap graphs

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

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