• GEODESIC GRAPHOIDAL COVERING NUMBER OF GRAPHS
Abstract
A geodesic graphoidal cover of a graph G is a collection of shortest paths in G such that every path in has at least two vertices, every vertex of G is an internal vertex of at most one path in and every edge of G is in exactly one path in . The minimum cardinality of a geodesic graphoidal cover of G is called the geodesic graphoidal covering number of G and is denoted by . In this paper we determine for bicyclic graphs.
Keywords
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |