Results 61 to 70 of about 5,146,733 (247)
On the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs, 2017 A \emph{graceful labeling} of a graph $G$ of size $n$ is an injective assignment of integers from the set $\{0,1,\dots,n\}$ to the vertices of $G$ such that when each edge has assigned a \emph{weight}, given by the absolute value of the difference of the
Christian Barrientos, Sarah Minion
doaj +1 more source
On (2-d)-kernels in the cartesian product of graphs
, 2016 In this paper we study the problem of the existence of (2-d)-kernels in the cartesian product of graphs. We give sufficient conditions for the existence of (2-d)-kernels in the cartesian product and also we consider the number of (2-d)-kernels.
P. Bednarz, I. Włoch
semanticscholar +1 more source
� Measure of Cartesian Product Sets [PDF]
Proceedings of the American Mathematical Society, 1975 It is proven that there exists a subset A A of Euclidean 2 2 -space such that the 2 2 -dimensional T \mathcal {T} measure of the Cartesian product of an interval of unit length and A A is greater than the 1 1 -dimensional
openaire +1 more source
Stability of cartesian products
Journal of Combinatorial Theory, Series B, 1978 AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivial connected cartesian products and show that all such products are semi-stable. Further we show that except for certain (listed) restricted graphs, connected cartesian products are semi-stable at every vertex.
Sims, Julie, Holton, D.A
openaire +3 more sources
Four New Sums of Second Hyper Zagreb Index Based on Cartesian Product
, 2021 M. Aruvi, J. Maria Joseph, E. Ramganesh
openalex +1 more source
Cartesian products avoiding patterns
, 2019 The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns such as finding a set whose Cartesian product avoids the zero set of a given function.
openaire +2 more sources
Distance antimagic labelings of Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order n. Let be a bijection. The weight w(v) of a vertex v with respect to the labeling f is defined by where N(v) is the open neighborhood of v. The labeling f is called a distance antimagic labeling if for any two distinct vertices v1,
Nancy Jaseintha Cutinho +2 more
doaj +1 more source
Selection on X 1 + X 2 + ⋯ + X m via Cartesian product trees. [PDF]
PeerJ Comput Sci, 2021 Kreitzberg P +3 more
europepmc +1 more source
Cartesian products of the $g$-topologies are a $g$-topology [PDF]
, 2020 Davron Jumaev +2 more
openalex +1 more source
On Path-Pairability in the Cartesian Product of Graphs
Discussiones Mathematicae Graph Theory, 2016 We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product.
Mészáros Gábor
doaj +1 more source