# Achromatic Coloring on Double Star Graph Families

## Related Articles

- Smarandachely k-Constrained Number of Paths and Cycles. Devadas Rao, P.; Sooryanarayana, B.; Jayalakshmi, M. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p48
A Smarandachely k-constrained labeling of a graph G(V,E) is a bijective mapping f : V ? E ? {1, 2, .., |V| + |E|} with the additional conditions that |f(u) - f(v)| ? k whenever uv ? E, |f(u)-f(uv)| ? k and |f(uv)-f(vw)| ? k whenever u ? w, for an integer k ? 2. A graph G which admits a such...

- Some Results on Super Mean Graphs. Vasuki, R.; Nagarajan, A. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p82
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,...

- Degree Equitable Sets in a Graph. Anitha, A.; Arumugam, S.; Sampathkumar, E. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p32
Let G = (V,E) be a graph. A subset S of V is called a Smarandachely degree equitable k-set for any integer k, 0 ? k ? ?(G) if the degrees of any two vertices in S differ by at most k. It is obvious that S = V (G) if k = ?(G). A Smarandachely degree equitable 1-set is usually called a degree...

- Chromatic Polynomial of Smarandache VE-Product of Graphs. Paryab, Khalil; Zare, Ebrahim // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p97
Let G1 = (V1,E1), G2 = (V2,E2) be two graphs. For a chosen edge set E ? E2, the Smarandache VE-product G1 ï¿½VE G2 of G1, G2 is defined by V (G1 ï¿½VE G2) = V1 ï¿½ V2, E(G1 ï¿½VE G2) = {(a, b)(a', b')|a = a', (b, b') ? E2, or b = b', (a, a') ? E1} ? {(a, b)(a', b')|(a, a') ? E1 and...

- Open Distance-Pattern Uniform Graphs. Jose, Bibin K. // International Journal of Mathematical Combinatorics;Oct2009, Vol. 3, p103
Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G is associated with the set fï¿½M(u) = {d(u, v) : v ? M, u ? v}, called its open M-distance-pattern. A graph G is called a Smarandachely uniform k-graph if there exist subsets M1,M2, ï¿½ï¿½ï¿½...

- Smarandachely antipodal signed digraphs. Reddy, P. Siva Kota; Prashanth, B.; Salestina, M. Ruby // Scientia Magna;2010, Vol. 6 Issue 3, p84
A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an ordered pair S = (D, s) (S = (D, ï¿½)) where D = (V, A) is a digraph called underlying digraph of S and ï¿½ : A ? (e1, e2; ï¿½, ek) (ï¿½ : V ? (e1, e2, ï¿½, ek)) is a function, where each ei ? {+, -}....

- Smarandachely t-path step signed graphs. Reddy, P. Siva Kota; Prashanth, B.; Lokesha, V. // Scientia Magna;2010, Vol. 6 Issue 3, p89
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, s) (S = (G, ï¿½)) where G = (V, E) is a graph called underlying graph of S and s : E ? (e1, e2, ï¿½, ek) (ï¿½ : V ? (e1, e2, ï¿½, ek)) is a function, where each ei ? {+, -}. Particularly, a...

- Some Results on Relaxed Mean Labeling. Maheswari, V.; Ramesh, D. S. T.; Balaji, V. // International Journal of Mathematical Combinatorics;Sep2015, Vol. 3, p73
In this paper, we investigate relaxed mean labeling of some standard graphs. We prove, any cycle is a relaxed mean graph; if n > 4, Kn is not a relaxed mean graph; K2,n is a relaxed mean graph for all n; any Triangular snake is a relaxed mean graph; any Quadrilateral snake is a relaxed mean...

- Sequences on Graphs with Symmetries. Linfan Mao // International Journal of Mathematical Combinatorics;Mar2011, Vol. 1, p20
No abstract available.