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

Relatively prime restrained detour domination number of a graph

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

DOI10.56947/GJOM.V16I2.1844zbMATH Open1539.05112MaRDI QIDQ6549470FDOQ6549470


Authors: C. Jayasekaran, L. G. Binoja Edit this on Wikidata


Publication date: 3 June 2024

Published in: Gulf Journal of Mathematics (Search for Journal in Brave)





Recommendations

  • Restrained and total restrained domination in graphs
  • Secure restrained domination in graphs
  • On the total restrained domination number of a graph
  • An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
  • Restrained domination in graphs with minimum degree two


zbMATH Keywords

domination numberdetour numberdetour domination numberrelatively prime detour domination numberrelatively prime domination numberrelatively prime restrained detour domination number


Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)







This page was built for publication: Relatively prime restrained detour domination number of a graph

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

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