Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Pawar, Ravindra"'
A positive integer $k$ is called a magic constant if there is a graph $G$ along with a bijective function $f$ from $V(G)$ to first $|V(G)|$ natural numbers such that the weight of the vertex $w(v) = \sum_{uv \in E}f(v) =k$ for all $v \in V$. It is kn
Externí odkaz:
http://arxiv.org/abs/2311.10330
Autor:
Pawar, Ravindra, Singh, Tarkehswar
In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.
Externí odkaz:
http://arxiv.org/abs/2306.07578
Given a graph $G =(V,E)$, a bijection $f: E \rightarrow \{1, 2, \dots,|E|\}$ is called a local antimagic labeling of $G$ if the vertex weight $w(u) = \sum_{uv \in E} f(uv)$ is distinct for all adjacent vertices. The vertex weights under the local ant
Externí odkaz:
http://arxiv.org/abs/2306.03559
Autor:
Pawar, Ravindra, Singh, Tarkeshwar
Let $G = (V,E)$ be a finite simple undirected graph without isolated vertices. A bijective map $f: V \cup E \rightarrow \{1,2, \dots, |V|+ |E| \}$ is called total local antimagic labeling if for each edge $uv \in E, w(u) \ne w(v)$, where $w(v)$ is a
Externí odkaz:
http://arxiv.org/abs/2303.14019
A graph $G=(V,E)$ is said to be distance magic if there is a bijection $f$ from a vertex set of $G$ to the first $|V(G)|$ natural numbers such that for each vertex $v$, its weight given by $\sum_{u \in N(v)}f(u)$ is constant, where $N(v)$ is an open
Externí odkaz:
http://arxiv.org/abs/2302.05652
Publikováno v:
South East Asian Journal of Mathematics & Mathematical Sciences; Aug2024, Vol. 20 Issue 2, p1-14, 14p
Autor:
Chikate, Surabhi D., Ghode, Gajanan S., Tibile, Raju M., Wasave, Sangita S., Pawar, Ravindra A., Tijare, Sonam, Patil, Ravindragouda, Pawase, Anil S.
Publikováno v:
Biochemical & Cellular Archives; Apr2024, Vol. 24 Issue 1, p1243-1249, 7p
Publikováno v:
In Arabian Journal of Chemistry February 2018 11(2):282-290
Publikováno v:
Electronic Journal of Graph Theory & Applications; 2024, Vol. 12 Issue 1, p75-88, 14p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.