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

Towards the conjecture on domination versus edge domination in graphs

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

DOI10.1007/S40840-023-01626-8OpenAlexW4389430278MaRDI QIDQ6186325FDOQ6186325


Authors: Paras Maniya, D. Pradhan Edit this on Wikidata


Publication date: 9 January 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-023-01626-8




Recommendations

  • Mathematical theories of traffic flow
  • Modeling, estimation, and their applications for distributed parameter systems
  • scientific article; zbMATH DE number 5055270
  • Lefschetz's principle
  • Superheating behavior in a breakdown reactor
  • scientific article; zbMATH DE number 3188569
  • scientific article
  • Pointwise Bounds for Solutions of Semilinear Parabolic Equations


zbMATH Keywords

dominationedge dominationminimum maximal matchingfork-free graphs


Mathematics Subject Classification ID

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


Cites Work

  • Domination versus edge domination on claw-free graphs
  • Domination versus edge domination






This page was built for publication: Towards the conjecture on domination versus edge domination in graphs

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

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