Results 1 to 10 of about 36 (29)

THE MONOPHONIC GRAPHOIDAL COVERING NUMBER OF A GRAPH [PDF]

International Journal of Pure and Applied Mathematics, 2014
A chord of a path P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A monophonic graphoidal cover of a graph G is a collection m of monophonic paths in G such that every vertex of G is an internal vertex of at most one monophonic path in m and every edge of G is in exactly one ...
P Titus
exaly   +2 more sources

Monophonic graphoidal covering number of corona product graphs

Proyecciones, 2023
In a graph G, a chordless path is called a monophonic path. A collection ψm of monophonic paths in G is called a monophonic graphoidal cover of G if every vertex of G is an internal vertex of at most one monophonic path in ψm and every edge of G is in exactly one monophonic path in ψm. The monophonic graphoidal covering number ηm(G) of G is the minimum
P Titus
exaly   +2 more sources

Graphs whose acyclic graphoidal covering number is one less than its maximum degree

Discrete Mathematics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S Arumugam
exaly   +3 more sources

SIMPLE GRAPHOIDAL COVERING NUMBER OF PRODUCT OF GRAPHS [PDF]

International Journal of Pure and Applied Mathematics, 2016
G V Narayanan
exaly   +2 more sources

Equality of graphoidal and acyclic graphoidal covering number of a graph

Tamkang Journal of Mathematics, 2006
A {\it graphoidal cover} of a graph $ G $ is a collection $ \psi $ of (not necessarily open) paths in $ G $ such that every vertex of $ G $ is an internal vertex of at most one path in $ \psi $ ad every edge of $ G $ is in exactly one path in $ \psi $.
Indra Rajasingh, P. Roushini Leely Pushpam   +1 more
openaire   +2 more sources

On label graphoidal covering number-I

Transactions on Combinatorics, 2012
Let G = (V,E) be a graph with p vertices and q edges. An acyclicgraphoidal cover of G is a collection of paths in G which are internallydisjointand covering each edge of the graph exactly once. Let f : V !{1, 2, . . . , p} be a bijective labeling of the vertices of G.
Sahul Hamid, Ismail, Anitha, Arumugaperumal   +1 more
openaire   +2 more sources

AN ELABORATE STUDY OF GRAPHOIDAL COVERING NUMBER OF A GRAPH

, 2019
A Graphoidal cover of a graph G = (V,E) is a collection of paths in G such that (a) every path has at least two vertices (b) every vertex of G is an internal vertex of at most one path, and (c) every edge of G is in some path. The graphoidal covering number (G) of G is defined to be the minimum cardinality of a graphoidal cover of G.
openaire   +2 more sources

GEODESIC GRAPHOIDAL COVERING NUMBER OF THE CORONA PRODUCT OF PATHS AND CYCLES

If each path of ψ is a shortest path in G, then a graphoidal cover ψ of a graph Gis said to be a geodesic graphoidal cover of G. It is denoted by ψg(G). The least cardinalityof a geodesic graphoidal cover, ψg(G), is referred to as the geodesic graphoidal coveringnumber of a graph G. It is represented by ηg(G).
openaire   +2 more sources

Optimizing wireless sensor networks using fuzzy triangular snake graph models and fuzzy topological indices. [PDF]

Sci Rep
Hashem AF, Liaqat S, Mufti ZS, Hanif MF.
europepmc   +1 more source

Graphoidal Length and Graphoidal Covering Number of a Graph

Lecture Notes in Computer Science, 2017
Let \(G=(V,E)\) be a finite graph. A graphoidal cover \(\varPsi \) of G is a collection of paths (not necessary open) in G such that every vertex of G is an internal vertex of at most one path in \(\varPsi \) and every edge of G is in exactly one path in \(\varPsi .\) The graphoidal covering number \(\eta \) of G is the minimum cardinality of a ...
Purnima Gupta, S Arumugam, Arumugam S
exaly   +2 more sources