Results 21 to 30 of about 53 (42)
Some of the next articles are maybe not open access.
Graphoidal Length and Graphoidal Covering Number of a Graph
Lecture Notes in Computer Science, 2017Let \(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 ...
Subramanian Arumugam +2 more
exaly +2 more sources
Journal of Discrete Mathematical Sciences and Cryptography, 2013
AbstractThe concept of graphoidal cover was introduced by B.D.Acharya and E.Sampathkumar. The concept of 2-graphoidal path cover was introduced by K. Nagarajan et.al in [4]. In this paper, we define a graphoidal path double cover of a graph G. A graphoidal path double cover of a graph G is a collection of paths Φ such that every vertex is an internal ...
V Maheswari
exaly +2 more sources
AbstractThe concept of graphoidal cover was introduced by B.D.Acharya and E.Sampathkumar. The concept of 2-graphoidal path cover was introduced by K. Nagarajan et.al in [4]. In this paper, we define a graphoidal path double cover of a graph G. A graphoidal path double cover of a graph G is a collection of paths Φ such that every vertex is an internal ...
V Maheswari
exaly +2 more sources
Ascending graphoidal tree cover for product graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2013AbstractAscending graphoidal tree cover of a graph G is a partition of edges of G into trees G1, G2, ..., Gn such that |E(Gi)| < |E(Gi+1)| for all i = 1 to n − 1 and every vertex of G is an internal vertex of at most one tree. In this paper, we investigate the ascending graphoidal tree cover for various product graphs.
V Maheswari
exaly +2 more sources
A note on the graphoidal covering number of a graph
Journal of Discrete Mathematical Sciences and Cryptography, 2002Abstract A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every vertex of G is an internal vertex of atmost one path in ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of a graphoidal cover of G is called the graphoidal covering number of G and is denoted by η.
Subramanian Arumugam, Indra Rajasingh
exaly +2 more sources
Graphs with unique minimum acyclic graphoidal cover – I
Journal of Discrete Mathematical Sciences and Cryptography, 2004Let G be a graph of order p and size q. An acyclic graphoidal cover of G is a collection Ψ of internally disjoint and edge-disjoint paths in G covering all the edges of G.
Subramanian Arumugam, Indra Rajasingh
exaly +2 more sources
Prediction on nature of cancer by fuzzy graphoidal covering number using artificial neural network
Artificial Intelligence in MedicinePredicting the chances of various types of cancers for different organs in the human body is a typical decision-making process in medicine and health. The signaling pathways have played a vital role in increasing or decreasing the possibility of the deadliest disease, cancer. To combine the pathways concept and ambiguity in the prediction techniques of
Anushree Bhattacharya, Madhumangal Pal
exaly +3 more sources
Simple Acyclic Graphoidal Covering Number In A Semigraph
Journal of Namibian Studies : History Politics Culture, 2023A simple graphoidal cover of a semigraph is a graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple graphoidal cover of is called the simple graphoidal covering number of a semigraph and is denoted by .
null W. Jinesha, null D. Nidha
openaire +1 more source
ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
Discrete Mathematics, Algorithms and Applications, 2011Let G = (V, E) be a graph with p vertices and q edges. An acyclic graphoidal cover of G is a collection ψ of paths in G which are internally disjoint and covering each edge of the graph exactly once. Let f : V → {1, 2, …, p} be a labeling of the vertices of G. Let ↑Gf be the directed graph obtained by orienting the edges uv of G from u to v provided f(
I. Sahul Hamid, A. Anitha
openaire +2 more sources
2019
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 longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex ...
Titus, P., Kumari, S.
openaire +1 more source
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 longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex ...
Titus, P., Kumari, S.
openaire +1 more source
On graphs whose acyclic graphoidal covering number is one less than its cyclomatic number.
Ars Comb., 2004Summary: A graphoidal cover of a graph \(G\) is a collection \(\psi\) of (not necessarily open) paths in \(G\) such that every vertex of \(G\) is in internal vertex of at most one path in \(\psi\) and every edge of \(G\) is an exactly one path in \(\psi\).
S. Arumugam +2 more
openaire +1 more source