Results 21 to 30 of about 2,865,652 (295)
Linearisation of frequency-hopped transmitters using Cartesian feedback [PDF]
, 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
Products of Geodesic Graphs and the Geodetic Number of Products
Discussiones Mathematicae Graph Theory, 2015 Given a connected graph and a vertex x ∈ V (G), the geodesic graph Px(G) has the same vertex set as G with edges uv iff either v is on an x − u geodesic path or u is on an x − v geodesic path.
Soloff Jake A. +2 more
doaj +1 more source
Different-distance sets in a graph [PDF]
Communications in Combinatorics and Optimization, 2019 A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.
Jason T. Hedetniemi +3 more
doaj +1 more source
Linkedness of Cartesian products of complete graphs [PDF]
, 2022 This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least 2k vertices is k-linked if, for every set of 2k distinct vertices organised in arbitrary k pairs of vertices, there are k vertex-disjoint paths ...
L K Jørgensen (13347852) +6 more
core +1 more source
The Crossing Numbers of Products of Path with Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj +1 more source
The Crossing Number of Two Cartesian Products [PDF]
, 2007 There are several known exact results on the crossing number of Cartesian products of paths, cycles, and complete graphs.
Lin Zhao +3 more
core +1 more source
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Hypo-q-Norms on a Cartesian Product of Algebras of Operators on Banach Spaces
Annales Mathematicae Silesianae, 2020 In this paper we consider the hypo-q-operator norm and hypo-q-numerical radius on a Cartesian product of algebras of bounded linear operators on Banach spaces.
Dragomir Silvestru Sever
doaj +1 more source
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
Distance Magic Cartesian Products of Graphs
Discussiones Mathematicae Graph Theory, 2016 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Cichacz Sylwia +3 more
doaj +1 more source