![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Geodesic Graphoidal Covering Number of a Graph
Subscribe/Renew Journal
A geodesic graphical 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 graphical cover of G is called the geodesic graphical covering number of G and is denoted by ηg. In this paper, we determine ηg for several classes of graphs. We also prove that ηg≥[q/d(G)] where d(G) is the diameter of G and characterize some classes o f graphs which attain this bound.
Keywords
Graphoidal Cover, Acyclic Graphoidal Cover, Geodcsic Graphoidal Cover.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 221
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0