A signed graph (or sigraph in short) is an ordered pair $S = (S^u,σ)$, where $S^u$ is a graph G = (V,E), called the underlying graph of S and σ:E → {+, -} is a function from the edge set E of $S^u$ into the set {+,-}, called the signature of S. The ×-line sigraph of S denoted by $L_×(S)$ is a sigraph defined on the line graph $L(S^u)$ of the graph $S^u$ by assigning to each edge ef of $L(S^u)$, the product of signs of the adjacent edges e and f in S. In this paper, first we define semi-total line sigraph and semi-total point sigraph of a given sigraph and then characterize balance and consistency of semi-total line sigraph and semi-total point sigraph
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (...
Abstract. A signed graph (marked graph) is an ordered pair S = (G, σ) (S = (G,µ)), where G = (V,E) i...
In this paper we introduced the new notions semifull signed graph and semifull line (block) signed g...
Abstract. A signed graph is a graph in which every edge is designated to be either positive or negat...
Dedicated to a great man, Dr. B. Devadas Acharya (1947–2013) Abstract. A signed graph is a graph who...
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x)...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
A signed graph (or sigraph in short) S is a graph G in which each edge x carries a value s(x) ∈ {+1...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (...
Abstract. A signed graph (marked graph) is an ordered pair S = (G, σ) (S = (G,µ)), where G = (V,E) i...
In this paper we introduced the new notions semifull signed graph and semifull line (block) signed g...
Abstract. A signed graph is a graph in which every edge is designated to be either positive or negat...
Dedicated to a great man, Dr. B. Devadas Acharya (1947–2013) Abstract. A signed graph is a graph who...
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x)...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
A signed graph (or sigraph in short) S is a graph G in which each edge x carries a value s(x) ∈ {+1...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...
Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on e...
Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ)...