Results 11 to 20 of about 53 (42)
Induced Graphoidal Covers In A Graph
, 2010 An induced graphoidal cover of a graph G is a collection ψ of (not necessarily open) 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 ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced cycle or an induced path.
K. Ratan Singh, P. K. Das
openaire +2 more sources
Coverings of Graphoids: Existence Theorem and Decomposition Theorems
SymmetryA graphoid is a mixed multigraph with multiple directed and/or undirected edges, loops, and semiedges. A covering projection of graphoids is an onto mapping between two graphoids such that at each vertex, the mapping restricts to a local bijection on incoming edges and outgoing edges. Naturally, as it appears, this definition displays unusual behaviour
Malnič, Aleksander, Zgrablić, Boris
openaire +1 more source
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 +1 more source
Characterization of a class of graphs with unique minimum graphoidal cover
Tamkang Journal of Mathematics, 2003 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 an internal vertex of at most one path in $ \psi$ and every edge of $ G$ is in exactly one path in $ \psi$. The minimum cardinality of a graphoidal cover of $ G$ is called the graphoidal covering number of $ G$ and is ...
Arumugam, S. +2 more
openaire +3 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 +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
SIMPLE GRAPHOIDAL COVERING NUMBER OF PRODUCT OF GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2016 G.V. Narayanan, J.S. Suseela, R. Kala
openaire +1 more source
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 RepHashem AF, Liaqat S, Mufti ZS, Hanif MF.
europepmc +1 more source
On 2 acyclic simple graphoidal covering of bicyclic graphs
Journal of Mathematical and Computational Science, 2020 openaire +1 more source