Results 21 to 30 of about 928,791 (254)
Smarandachely t-path step signed graphs [PDF]
Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +1 more source
Smarandache Directionally n-Signed Graphs — A Survey [PDF]
For graph theory terminology and notation in this paper we follow the book [3]. All graphs considered here are finite and simple.
P. Siva Kota Reddy, Reddy, P.Siva Kota
core +1 more source
The n-th Power Signed Graphs-II [PDF]
For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Negation Switching Equivalence in Signed Graphs [PDF]
Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core +1 more source
A Note on Path Signed Digraphs [PDF]
The concept of a line signed digraph is generalized to that of a path signed ...
S. Vijay +5 more
core +1 more source
Coloring problem of signed interval graphs [PDF]
A signed graph $(G,\sigma)$ is a graph together with an assignment of signs $\{+,-\}$ to its edges where $\sigma$ is the subset of its negative edges.
Farzaneh Ramezani
doaj +1 more source
Further Results on the Nullity of Signed Graphs
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we apply the coefficient theorem on the characteristic polynomial of a signed graph and
Yu Liu, Lihua You
doaj +1 more source
Signed random walk diffusion for effective representation learning in signed graphs.
How can we model node representations to accurately infer the signs of missing edges in a signed social graph? Signed social graphs have attracted considerable attention to model trust relationships between people. Various representation learning methods
Jinhong Jung, Jaemin Yoo, U Kang
doaj +2 more sources
On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$ [PDF]
A emph{signed graph} (or, in short, emph{sigraph}) $S=(S^u,sigma)$ consists of an underlying graph $S^u :=G=(V,E)$ and a function $sigma:E(S^u)longrightarrow {+,-}$, called the signature of $S$. A emph{marking} of $S$ is a function $mu:V(S)longrightarrow
Mukti Acharya +2 more
doaj
Estrada Index and Some Properties of Partially Signed Graphs [PDF]
A signed graph is a graph with signed edges. Recently, a special graph consisting of signed and unsigned edges has been introduced and is called a partially signed graph.
Shila Razavi, Gholam Fath-Tabar
doaj +1 more source

