Results 31 to 40 of about 2,775,539 (295)
Neutrosophic Hyperideals of Semihyperrings [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we have introduced neutrosophic hyperideals of a semihyperring and considered some operations on them to study its basic notions and properties.
Debabrata Mandal
doaj
The Cartesian product of graphs with loops
Ars Mathematica Contemporanea, 2015 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number
Tetiana Boiko +4 more
openaire +4 more sources
When is Cartesian product a Cayley graph? [PDF]
, 2023 A graph is said to be a Cayley graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph.
Hujdurović, Ademir +3 more
core
New Results on the Aggregation of Norms
Mathematics, 2021 It is a natural question if a Cartesian product of objects produces an object of the same type. For example, it is well known that a countable Cartesian product of metrizable topological spaces is metrizable.
Tatiana Pedraza +1 more
doaj +1 more source
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +1 more source
Factorization of Cartesian Products of Hypergraphs [PDF]
, 2010 In this article we present the L2-section, a tool used to represent a hypergraph in terms of an "advanced graph" and results leading to first algorithm, in O(nm), for a bounded-rank, bounded-degree hypergraph H, which factorizes H in prime factors. The paper puts a premium on the characterization of the prime factors of a hypergraph, by exploiting ...
Alain Bretto, Yannick Silvestre
openaire +3 more sources
E-cordial Labeling for Cartesian Product of Some Graphs [PDF]
, 2011 We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 andK1,n × P2 are E-cordial for n odd.
Vaidya, S. K., Vyas, N. B.
core +1 more source
Fork-Decomposition of Cartesian Product of Graphs [PDF]
, 2023 Let G = (V, E) be a graph. Fork is a tree obtained by subdividing any edge of a star of size three exactly once. In this paper, we investigate the necessary and sufficient condition for the fork-decomposition of Cartesian product of ...
Issacraj, Samuel, Joseph, J. Paulraj
core +1 more source
Motion planning in cartesian product graphs
Discussiones Mathematicae Graph Theory, 2014 Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole.
Deb Biswajit, Kapoor Kalpesh
doaj +1 more source