Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,µ)) where G = (V, E) is a graph called underlying graph of S and σ: E → (e1, e2,..., ek) (µ: V → (e1, e2,..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. In this note, we obtain a structural char-acterization of jump symmetric n-sigraphs. The notion of jump symmetric n-sigraphs wa
Abstract A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an or-dered pair S = (...
summary:A $(p,q)$-sigraph $S$ is an ordered pair $(G,s)$ where $G = (V,E)$ is a $(p,q)$-graph and $s...
Abstract. A signed graph (marked graph) is an ordered pair S = (G, σ) (S = (G,µ)), where G = (V,E) i...
Abstract A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ)...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ...
Abstract: A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an ordered pair S = (...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
For standard terminology and notion in graph theory we refer the reader to West; the nonstandard wil...
Abstract: An n-tuple (a1, a2,..., an) is symmetric, if ak = an−k+1, 1 ≤ k ≤ n. Let Hn = {(a1, a2, ·...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair.... DOI : http://dx...
Introducing a new notion S-antipodal symmetric n-sigraph of a symmetric n-sigraph and its properties...
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x)...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.d...
A signed graph (or sigraph in short) is an ordered pair $S = (S^u,σ)$, where $S^u$ is a graph G = (V...
Abstract A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an or-dered pair S = (...
summary:A $(p,q)$-sigraph $S$ is an ordered pair $(G,s)$ where $G = (V,E)$ is a $(p,q)$-graph and $s...
Abstract. A signed graph (marked graph) is an ordered pair S = (G, σ) (S = (G,µ)), where G = (V,E) i...
Abstract A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ)...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ...
Abstract: A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an ordered pair S = (...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
For standard terminology and notion in graph theory we refer the reader to West; the nonstandard wil...
Abstract: An n-tuple (a1, a2,..., an) is symmetric, if ak = an−k+1, 1 ≤ k ≤ n. Let Hn = {(a1, a2, ·...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair.... DOI : http://dx...
Introducing a new notion S-antipodal symmetric n-sigraph of a symmetric n-sigraph and its properties...
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x)...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.d...
A signed graph (or sigraph in short) is an ordered pair $S = (S^u,σ)$, where $S^u$ is a graph G = (V...
Abstract A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an or-dered pair S = (...
summary:A $(p,q)$-sigraph $S$ is an ordered pair $(G,s)$ where $G = (V,E)$ is a $(p,q)$-graph and $s...
Abstract. A signed graph (marked graph) is an ordered pair S = (G, σ) (S = (G,µ)), where G = (V,E) i...