Results 21 to 30 of about 80 (47)

International Journal of Mathematical Combinatorics, Vol.3 [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

AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]

, 2011
Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core   +1 more source

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

Symmetry
A 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
Aleksander Malnič, Boris Zgrablić
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., Rajasingh, Indra, Pushpam, P. Roushini Leely   +2 more
openaire   +3 more sources

On a graph isomorphic to its intersection graph: Self-graphoidal graphs

, 2018
A graph G is called a graphoidal graph if there exists a graph H and a graphoidal cover ψ of H such that G =∼ Ω(H,ψ). Then the graph G is said to be self-graphoidal if it is isomorphic to one of its graphoidal graphs.
Das, PK, Singh, KR
core   +1 more source

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 Rep
Hashem AF, Liaqat S, Mufti ZS, Hanif MF.
europepmc   +1 more source