Deepakshi Sharma

  • Citations Per Year
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)
A signed graph is a simple graph where each edge receives a sign positive or negative. Such graphs are mainly used in social sciences where individuals represent vertices friendly relation between them as a positive edge and enmity as a negative edge. In signed graphs, we define these relationships (edges) as of friendship ("+" edge) or hostility ("-"(More)
In this paper, we generalize the iterated local transitivity (ILT) model for online social networks for signed networks. Signed networks focus on the type of relations (friendship or enmity) between the vertices (members of online social networks). The ILT model for signed networks provide an insight into how networks react to the addition of clone vertex.(More)
  • 1