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

Vertex-to-clique monophonic distance in graphs.

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

zbMATH Open1449.05083MaRDI QIDQ5206364FDOQ5206364


Authors: I. Keerthi Asir, S. Athisayanathan Edit this on Wikidata


Publication date: 18 December 2019





Recommendations

  • Clique-to-vertex monophonic distance in graphs
  • The connected vertex monophonic number of a graph
  • Monophonic distance in graphs
  • Vertex-to-clique detour distance in graphs
  • scientific article; zbMATH DE number 7280158


zbMATH Keywords

vertex-to-clique detour distancevertex-to-clique distance


Mathematics Subject Classification ID

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



Cited In (6)

  • Monophonic-triangular distance in graphs
  • Vertex-to-clique detour distance in graphs
  • Clique-to-vertex monophonic distance in graphs
  • Upper triangle free detour number of a graph
  • Monophonic distance in graphs
  • Title not available (Why is that?)





This page was built for publication: Vertex-to-clique monophonic distance in graphs.

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

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