Results 71 to 80 of about 232,590 (215)

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

Persistent homology based Bottleneck distance in hypergraph products

Applied Network Science
In 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 Topology
The 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

An interpolative class of two-Lipschitz mappings of composition type

Applied General Topology
The 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

Fuzzy Product KM-Subalgebras and Some Related Properties

Complexity, 2021
The concept of KM-algebras has been originated in 2019. KM-algebra is a generalization of some of the B-algebras such as BCK, BCI, BCH, BE, and BV and also d-algebras.
K. Kalaiarasi, V. Manimozhi, N. Kausar, D. Pamucar, S. Kousar, Y. U. Gaba   +5 more
doaj   +1 more source

Dominating Cartesian products of cycles

Discrete Applied Mathematics, 1995
AbstractLet γ(G) be the domination number of a graph G and let G □ H denote the Cartesian product of graphs G and H. We prove that γ(X) = (Πmk = 1nk)(2m + 1), where X = C1□C2□ … □ Cm and all nk = ¦Ck¦, 1 ⩽ k ⩽ m, are multiples of 2m + 1. The methods we use to prove this result immediately lead to an algorithm for finding minimum dominating sets of the ...
Sandi Klavžar, Norbert Seifter
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, S. Sudha, S. Arumugam   +2 more
doaj   +1 more source

Hypo-q-Norms on a Cartesian Product of Normed Linear Spaces

, 2017
In this paper we introduce the hypo-q-norms on a Cartesian product of normed linear spaces. A representation of these norms in terms of bounded linear functionals of norm less than one, the equivalence with the q-norms on a Cartesian product and some ...
Dragomir, Silvestru Sever
core  

Selection on X ₁ + X ₂ + ⋯ + X _m via Cartesian product trees. [PDF]

PeerJ Comput Sci, 2021
Kreitzberg P, Lucke K, Pennington J, Serang O.   +3 more
europepmc   +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 ...
Bretto, Alain, Sylvestre, Yannick
openaire   +3 more sources