Results 21 to 30 of about 108,525 (194)

ODD HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH

open access: yesJurnal 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

On cofree S-spaces and cofree S-flows

open access: yesApplied 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

A New Notion of Classical Mean Graphs Based on Duplicating Operations

open access: yesJournal 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

The Structure Of Functional Graphs For Functions From A Finite Domain To Itself For Which A Half Iterate Exists

open access: yesTheory 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

Bacterial injection machines: Evolutionary diverse but functionally convergent

open access: yesCellular Microbiology, 2020
Many human pathogens use Type III, Type IV, and Type VI secretion systems to deliver effectors into their target cells. The contribution of these secretion systems to microbial virulence was the main focus of a workshop organised by the International University of Andalusia in Spain.
Sophie Bleves   +2 more
openaire   +6 more sources

On the degree of intuitionistic fuzzy functions and its various classification degrees [PDF]

open access: yesNotes on IFS
In 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

open access: yesRatio 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

Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations

open access: yesمجلة بغداد للعلوم, 2023
Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G.
M. Uma Devi, M. Kamaraj, S. Arockiaraj
doaj   +1 more source

Graceful labeling on torch graph

open access: yesIndonesian Journal of Combinatorics, 2018
Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
doaj   +1 more source

A Study on C-Exponential Mean Labeling of Graphs

open access: yesJournal of Mathematics, 2022
A function h is mentioned as a C-exponential mean labeling of a graph GV,E that has s vertices and r edges if h:VG⟶1,2,3,⋯,r+1 is injective and the generated function h∗:EG⟶2,3,4,⋯,r+1 defined by h∗ab=1/ehbhb/haha1/hb−ha, for all ab∈EG, is bijective.
Thamaraiselvi Baskaran   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy