Results 11 to 20 of about 80 (47)
Monophonic graphoidal covering number of corona product graphs
Proyecciones (Antofagasta), 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
Titus, P., Subha, M., Kumari, S. Santha
openaire +2 more sources
Graphoidal Tree D - Cover [PDF]
, 2009 Acharya and Sampathkumar defined a graphoidal cover as a partition of edges into internally disjoint (not necessarily open) paths. If we consider only open paths in the above definition then we call it as a graphoidal path cover.
Somasundaram, S. +2 more
openaire +4 more sources
Induced Acyclic Graphoidal Covers In A Graph
, 2010 An induced acyclic graphoidal cover of a graph G is a collection ψ of open paths in G such that every path in ψ has atleast two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced path.
K. Ratan Singh, P. K. Das
openaire +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 0001 +2 more
openaire +3 more sources
On self-graphoidal graphs and their complements
Kuwait Journal of ScienceThe graphoidal graph G of graph H is the graph obtained by taking graphoidal cover Ψ of H as vertices and two vertices are adjacent if and only if the corresponding paths have a non-empty intersection.
Singh K.R., Pirzada S.
doaj +3 more sources
On 2−simple graphoidal cover of a graph [PDF]
AIP Conference Proceedings, 2020 G V Narayanan
exaly +2 more sources
Graphoidally independent infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2021 A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths in G, called ψ-edges, (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path ...
Purnima Gupta, Deepti Jain
doaj +1 more source
THE MONOPHONIC GRAPHOIDAL COVERING NUMBER OF A GRAPH [PDF]
International Journal of Pure and Apllied 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, S.S. Kumari
openaire +1 more source
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 +1 more
openaire +2 more sources
International Journal of Mathematical Combinatorics, Vol.3A [PDF]
, 2009 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source