Results 31 to 40 of about 108,525 (194)
Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism [PDF]
, 2013 For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $\varphi \colon V(G) \to V(H)$, which maps vertices adjacent in $G$ to adjacent vertices of $H$. A homomorphism is locally injective if no two vertices with a common neighbor are mapped
Rzążewski, Paweł
core +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Square Sum And Square Difference Labelings Of Semitotal-block Graph For Some Class Of Graphs
Ratio Mathematica, 2023 A graph G is said to be square sum and square difference labeling, if there exists a bijection f from V (G) to {1, 2, 3, ..., (p − 1)} which induces the injective function f ∗ from E(G) to N, defined by f ∗(uv) = f(u)2 + f(v)2 and f ∗(uv) = f(u)2 − f(v)2
Keerthi G. Mirajkar +1 more
doaj +1 more source
Generation type inequalities for closed linear operators related to domains with conical points [PDF]
, 2005 Let ${\cal A}(x;D_x)$ be a second-order linear differential operator in divergence form. We prove that the operator ${\l}I- {\cal A}(x;D_x)$, where $\l\in\csp$ and $I$ stands for the identity operator, is closed and injective when ${\rm Re}\l$ is large ...
Favaron, A.
core +3 more sources
Some New Results on Strong Integer Additive Set-Indexers of Graphs
, 2014 Let $\mathbb{N}_0$ be the set of all non-negative integers. An integer additive set-indexer of a graph $G$ is an injective function $f:V(G)\to 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $f^+(uv ...
Germina, K. A., Sudev, N. K.
core +2 more sources
The weak pigeonhole principle for function classes in S^1_2 [PDF]
, 2006 It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S^1_2 for provably ...
Buss +12 more
core +1 more source
Journal of Combinatorial Theory, Series A, 1974 AbstractThe present paper is concerned with a combinatorial question called the “marriage problem.”. A criterion will be proved for the existence of an injective choice function of families with at most finitely many infinite members and a generalization of a theorem of H. A. Jung and R. Rado. We give a new proof of a theorem of J. Folkman.
openaire +2 more sources
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
E-Jurnal Matematika, 2017 Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph .
TIRA CATUR ROSALIA +2 more
doaj +1 more source
A Study on Integer Additive Set-Graceful Graphs [PDF]
, 2015 A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow \mathcal{P}(X)-\{\emptyset\}$ defined by $f^
Germina, K. A., Sudev, N. K.
core
Associative string functions [PDF]
, 2014 We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string functions.
Lehtonen, Erkko +2 more
core +2 more sources