Abstract A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an or-dered pair S = (D,σ) (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 ∈ {+,−}. Particularly, a Smarandachely 2-signed digraph or Smarandachely 2-marked digraph is called abbreviated a signed digraph or a marked digraph. In this paper, we define the Smarandachely antipodal signed digraph A (D) of a given signed digraph S = (D,σ) and offer a structural characterization of antipodal signed digraphs. Further, we characterize signed digraphs S for which S ∼ −→A (S) and S ∼ −→A (S) where ∼ denotes switching equivalence and −→A (S) and S are denotes the Smarand...
Let D be a finite and simple digraph with the vertex set V (D), and let f: V (D) → {−1, 1} be a two-...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ...
AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of ...
Abstract: A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an ordered pair S = (...
For standard terminology and notion in digraph theory, we refer the reader to the classic text-books...
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 graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
[[abstract]]In this paper we introduced a new notion S-antipodal signed graph of a signed graph and ...
In this paper we strive towards a mathematical theory for “marked digraphs ” in which the nodes are ...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.d...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair.... DOI : http://dx...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → {-1,1} be a two-valu...
Let D be a finite and simple digraph with the vertex set V (D), and let f: V (D) → {−1, 1} be a two-...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ...
AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of ...
Abstract: A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an ordered pair S = (...
For standard terminology and notion in digraph theory, we refer the reader to the classic text-books...
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 graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
[[abstract]]In this paper we introduced a new notion S-antipodal signed graph of a signed graph and ...
In this paper we strive towards a mathematical theory for “marked digraphs ” in which the nodes are ...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.d...
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair.... DOI : http://dx...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → {-1,1} be a two-valu...
Let D be a finite and simple digraph with the vertex set V (D), and let f: V (D) → {−1, 1} be a two-...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ...
AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of ...