Monophonic graphoidal covering number of corona product graphs

DOI10.22199/ISSN.0717-6279-4781zbMath1518.05157OpenAlexW4361023968MaRDI QIDQ6113660

Unnamed Author, P. Titus, S. Santha Kumari

Publication date: 11 July 2023

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-4781

zbMATH Keywords

graphoidal covermonophonic pathmonophonic graphoidal covermonophonic graphoidal covering number

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphoidal covers and graphoidal covering number of a graph
• On the graphoidal covering number of a graph
• The graphoidal covering number of unicyclic graphs
• Graphs with unique minimum graphoidal cover
• Acyclic graphoidal covers and path partitions in a graph
• MONOPHONIC DISTANCE IN GRAPHS
• A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS"

This page was built for publication: Monophonic graphoidal covering number of corona product graphs