Results 11 to 20 of about 108,525 (194)
Properly injective spaces and function spaces
Given an injective space \(D\) (a continuous lattice endowed with the Scott topology) and a subspace embedding \(j:X\to Y\), Dana Scott asked whether the higher-order function \([X\to D]\to [Y\to D]\) that takes a continuous map \(f:X\to D\) to its greatest extension \(\overline f:Y\to D\) is Scott continuous. Excluding the trivial case that \(D\) is a
Martín Hötzel Escardó
openaire +4 more sources
Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined by and all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling.
M Sree Vidya, S.S Sandhya
doaj +1 more source
Additively graceful signed graphs
Let [Formula: see text] be a signed graph of order p and size q. Let [Formula: see text] and [Formula: see text] Let [Formula: see text] be an injective function and let [Graphic: see text]gf(uv)={|f(u)−f(v)| if uv∈E+f(u)+f(v) if uv∈E−The function f is ...
Jessica Pereira +2 more
doaj +1 more source
Injectivity of Composite Functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schwartzbach, Michael Ignatieff +1 more
openaire +3 more sources
Preservation theorems for Tarski's relation algebra [PDF]
We 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
PELABELAN ODD-GRACEFUL PADA GRAF PRODUK SISIR
Gnanajothi defined a graph with edges to be odd-graceful if there is an injective function such that if every edge is labelled with the resulting edge labels are . She proved that the graph obtained by joining one pendant to every vertex in is odd-
Juan Daniel +3 more
doaj +1 more source
Strong Integer Additive Set-valued Graphs: A Creative Review [PDF]
For a non-empty ground set $X$, finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \to \mathcal{P}(X)$, where $\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $
K. A. Germina +3 more
core +1 more source
On Square Sum Labeling of Two Families of Petersen Graphs
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
On the real differential of a slice regular function [PDF]
In this paper we show that the real differential of any injective slice regular function is everywhere invertible. The result is a generalization of a theorem proved by G. Gentili, S. Salamon and C.
Altavilla, Amedeo
core +1 more source
A Study on the Nourishing Number of Graphs and Graph Powers
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

