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 graphs whose graphoidal domination number is one

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

DOI10.1016/j.akcej.2015.11.007zbMath1346.05222OpenAlexW2209991604MaRDI QIDQ321997

Deepti Jain, Purnima Gupta, Belmannu Devadas Acharya

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.007


zbMATH Keywords

\(\psi\)-dominationgraphoidal covergraphoidally covered graph


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (1)

Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II



Cites Work

  • Unnamed Item
  • Graphoidal covers and graphoidal covering number of a graph
  • Domination in graphoidal covers of a graph
  • Parallel concepts in graph theory
  • Further results on domination in graphoidally covered graphs




This page was built for publication: On graphs whose graphoidal domination number is one

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:321997&oldid=12198774"
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 02:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki