background: definite data regarding the incidence and distribution of renal tumours in eastern india is not known. for better management, as it is essential to identify patients with poor prognosis, prognostic factors like stage, nuclear grade and their relationship to molecular markers are also unclear in this region. the purpose of our study was to assess the spectrum of adult renal tumours w...

A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph that admits a near mean labeling is called a near mean graph (NMG). In this paper, we proved that the graphs Pn, Cn,K2,n are near mean graphs and Kn(n > 4) and K1,n(n > 4) are not near mean graphs.

Background: Definite data regarding the incidence and distribution of renal tumours in eastern India is not known. For better management, as it is essential to identify patients with poor prognosis, prognostic factors like stage, nuclear grade and their relationship to molecular markers are also unclear in this region. The purpose of our study was to assess the spectrum of adu...

Let G be a graph and f : V (G) → {1, 2, 3, . . . , p+ q} be an injection. For each edge e = uv and an integer m ≥ 2, the induced Smarandachely edge m-labeling f∗ S is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, . . . , p+ q}. Particularly, in the case of m = 2, we know that f ∗(e) =    f(u)+f(v) ...

for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ ...

In this paper we generalize the remainder cordial labeling, called $k$-remainder cordial labeling and investigate the $4$-remainder cordial labeling behavior of certain graphs.

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...