Zobrazeno 1 - 10
of 16
pro vyhledávání: '"S. Devi Yamini"'
Given a (proper) vertex coloring $f$ of a graph $G$, say $f\colon V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h\colon E(G)\to \mathbb{N}$ defined as $h(uv)=|f(u)-f(v)|$ for every edge $uv$ of $G$. A graceful color
Externí odkaz:
http://arxiv.org/abs/2407.02179
Autor:
D., Laavanya, S., Devi Yamini
A graceful $l$-coloring of a graph $G$ is a proper vertex coloring with $l$ colors which induces a proper edge coloring with at most $l-1$ colors, where the color for an edge $ab$ is the absolute difference between the colors assigned to the vertices
Externí odkaz:
http://arxiv.org/abs/2406.20032
Autor:
D, Nivedha, S, Devi Yamini
An antimagic labeling of a graph $G$ is a one-to-one correspondence between the edge set $E(G)$ and $\lbrace 1,2,...,|E(G)|\rbrace$ in which the sum of the edge labels incident on the distinct vertices are distinct. Let $G$,$H_1$,$H_2$,...,$H_{m-1}$,
Externí odkaz:
http://arxiv.org/abs/2311.10335
Autor:
T, Divya, S, Devi Yamini
A bijective function $f:V\rightarrow\left\{1,2,3,...,|V| \right\}$ is said to be a local distance antimagic labeling of a graph $G=(V,E)$, if $w(u)\neq w(v)$ for any two adjacent vertices $u, v$ where the weight $w(v)=\sum_{z\in N(v)}f(z)$. The local
Externí odkaz:
http://arxiv.org/abs/2106.01833
Publikováno v:
Journal of Combinatorial Optimization. 35:1312-1329
A partition of the vertex set V(G) of a graph G into $$V(G)=V_1\cup V_2\cup \cdots \cup V_k$$V(G)=V1źV2źźźVk is called a k-strong subcoloring if $$d(x,y)\ne 2$$d(x,y)ź2 in G for every $$x,y\in V_i$$x,yźVi, $$1\le i \le k$$1≤i≤k where d(x, y
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5ab4d0c71d25847bc4a018de98895bb
https://doi.org/10.1007/s10878-018-0272-z
https://doi.org/10.1007/s10878-018-0272-z
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.
Autor:
S. Devi Yamini, M. A. Shalu
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 633-647 (2017)
In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained homo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21500daf0e0662d5f0709bef155e24be
https://doaj.org/article/2fb765c59db44a8893ab7f4b0d77fc77
https://doaj.org/article/2fb765c59db44a8893ab7f4b0d77fc77
Autor:
S. Devi Yamini, M. A. Shalu
Publikováno v:
Electronic Notes in Discrete Mathematics. 53:73-82
An induced 2K2 of a graph is said to be good if two edges of the 2K2 are at distance three in the graph. In this paper, we give a structural description of the class of all P5-free graphs containing a good 2K2. In particular, we prove that the maximu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c837543299abc1bd2ec6f23cae13d6ec
https://doi.org/10.1016/j.endm.2016.05.007
https://doi.org/10.1016/j.endm.2016.05.007