Deepakshi Sharma

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A signed graph (sigraph) is a graph where each edge receives positive or negative sign. In this paper, we report our investigation on a new signed graph (S)<inf>2</inf> called 2-path sigraphs of a given sigraph S defined as that sigraph whose vertex set is the vertex set of S and two vertices in (S)<inf>2</inf> are adjacent if there exist a path of length(More)
A signed graph (or sigraph, in short) is an ordered pair S = (S<sup>u</sup>,&#x03C3;), where S<sup>u</sup> is a graph G = (V,E), called the underlying graph of S and &#x03C3; : E&#x2192; {+,-}is a function from the edge set E of S<sup>u</sup> into the set {+,-}, called the signature of S. A sigraph is also denoted as S = (V;E,&#x03C3;). A two path sigraph(More)
  • 1