Results 11 to 20 of about 2,513 (245)
Preservation theorems for Tarski's relation algebra [PDF]
Logical Methods in Computer ScienceWe investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations.
Bart Bogaerts +3 more
doaj +1 more source
On Square Sum Labeling of Two Families of Petersen Graphs
Journal of Mathematics, 2022 A labeling on a graph G with n vertices and m edges is called square sum if there exists a bijection f:VG⟶0,1,2,3,…,n−1 such that the function f∗:EG⟶N defined by f∗st=fs2+ft2, for all st∈EG, is injective.
Zhiqiang Zhang +3 more
doaj +1 more source
A study on integer additive set-valuations of signed graphs
Karpatsʹkì Matematičnì Publìkacìï, 2015 Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to\mathcal{P}(\mathbb{N}_0)\setminus ...
N.K. Sudev, K.A. Germina
doaj +1 more source
ODD HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH
Jurnal Diferensial, 2023 Graph is an ordered pair of a vertex and edge set that related with various theories, one of them called labeling. There are a lot of types of graph labeling, one of them is odd harmonious labeling. The odd harmonious labeling is an injective function f :
Demetriana Kolo +2 more
doaj +1 more source
A Study on the Nourishing Number of Graphs and Graph Powers
Mathematics, 2015 Let \(\mathbb{N}_{0}\) be the set of all non-negative integers and \(\mathcal{P}(\mathbb{N}_{0})\) be its power set. Then, an integer additive set-indexer (IASI) of a given graph \(G\) is defined as an injective function \(f:V(G)\to \mathcal{P}(\mathbb{N}
Sudev Naduvath, Germina Augustine
doaj +1 more source
A New Notion of Classical Mean Graphs Based on Duplicating Operations
Journal of Mathematics, 2022 Classical mean labeling of a graph G with p vertices and q edges is an injective function from the vertex set of G to the set 1,2,3,…,q+1 such that the edge labels obtained from the flooring function of the average of mean of arithmetic, geometric ...
A. Rajesh Kannan +3 more
doaj +1 more source
Theory and Applications of Graphs, 2021 The notion of a replica of a nontrivial in-tree is defined. A result enabling to determine whether an in-tree is a replica of another in-tree employing an injective mapping between some subsets of sources of these in-trees is presented.
Paweł Kozyra
doaj +1 more source
On cofree S-spaces and cofree S-flows
Applied General Topology, 2012 Let S-Tych be the category of Tychonoff S-spaces for a topological monoid S. We study the cofree S-spaces and cofree S-flows over topological spaces and we prove that for any topological space X and a topological monoid S, the function space C(S,X) with ...
Behnam Khosravi
doaj +1 more source
On the degree of intuitionistic fuzzy functions and its various classification degrees [PDF]
Notes on IFSIn this paper, we explore the concept of degree of the intuitionistic fuzzy functions. In [4], Demirci studied gradations of fuzzy functionhood. There, for a fuzzy relation ƒ on X×Y, considering the fuzzy equalities E_X on X and E_Y on Y the degree of ƒ ...
Ümit Deniz, Neslihan Yılmaz
doaj +1 more source
Polygonal Graceful Labeling of Some Simple Graphs
Ratio Mathematica, 2022 Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj +1 more source