Results 41 to 50 of about 2,669,595 (286)

The Cartesian product of graphs with loops

open access: yesArs 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

Linearisation of frequency-hopped transmitters using Cartesian feedback [PDF]

open access: yes, 1995
This paper investigates the potential of the Cartesian feedback technique in linearising frequency-hopped (FH) transmitters for use in third generation mobile communication systems.
Boloorian, M, McGeehan, JP
core   +1 more source

Edge-Transitive Lexicographic and Cartesian Products

open access: yesDiscussiones 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

New Results on the Aggregation of Norms

open access: yesMathematics, 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

The generalized 3-connectivity of Cartesian product graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj   +1 more source

Factorization of Cartesian Products of Hypergraphs [PDF]

open access: yes, 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

A novel framework for the Cartesian product of clique simplicial complexes and its applications

open access: yesJournal of Taibah University for Science
This article develops a theoretical framework for the Cartesian product of simplicial complexes, with a focus on clique complexes due to their increasing importance in applications such as social network analysis, biological network modelling, data ...
Kausar Perveen   +3 more
doaj   +1 more source

Loosely Bernoulli Cartesian products [PDF]

open access: yesProceedings of the American Mathematical Society, 1979
For any totally ergodic loosely Bernoulli automorphism T , a class S (
openaire   +1 more source

Generalized 3-edge-connectivity of Cartesian product graphs [PDF]

open access: yes, 2015
summary:The generalized $k$-connectivity $\kappa _{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al.
Sun, Yuefang
core   +1 more source

Completeness and Cartesian Product in Neutrosophic Rectangular n-Normed Spaces

open access: yesDera Natung Government College Research Journal
This study introduces the new concept of neutrosophic rectangular $n$-normed spaces, along with essential foundational definitions. It then explores the Cartesian product of such spaces and examines how this operation influences their structural ...
Mukhtar Ahmad, Mohammad Mursaleen
doaj   +1 more source

Home - About - Disclaimer - Privacy