Results 41 to 50 of about 16,768 (145)
Persistent homology based Bottleneck distance in hypergraph products
Applied Network ScienceIn this paper, we extended the technique of measuring similarity between topological spaces using bottle neck distance between persistence diagrams to hypergraph networks. Finding a relationship between the bottleneck distance of the Cartesian product of
Archana Babu, Sunil Jacob John
doaj +1 more source
The extension of two-Lipschitz operators
Applied General TopologyThe paper deals with some further results concerning the class of two-Lipschitz operators. We prove first an isometric isomorphism identification of two-Lipschitz operators and Lipschitz operators.
Elhadj Dahia
doaj +1 more source
Distinguishing Cartesian products of countable graphs
Discussiones Mathematicae Graph Theory, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estaji Ehsan +4 more
openaire +2 more sources
An interpolative class of two-Lipschitz mappings of composition type
Applied General TopologyThe paper deals with some further results concerning the class of two-Lipschitz operators. We prove first an isometric isomorphism identification of two-Lipschitz operators and Lipschitz operators.
Khaled Hamidi, Abdelhamid Tallab
doaj +1 more source
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
Distance magic Cartesian product of graphs
Discussiones Mathematicae Graph Theory, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cichacz Sylwia +3 more
openaire +3 more sources
� 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
Distance Measurements Related to Cartesian Product of Cycles
Journal of Mathematics, 2020 Graph theory and its wide applications in natural sciences and social sciences open a new era of research. Making the graph of computer networks and analyzing it with aid of graph theory are extensively studied and researched in the literature.
Xiaoli Qiang +5 more
doaj +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