Results 21 to 30 of about 329,714 (296)
COMMON-EDGE SIGNED GRAPH OF A SIGNED GRAPH [PDF]
A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.doi.org/10.22342/jims.16.2.34.105 ...
P. Siva Kota Reddy +2 more
openaire +2 more sources
Signed graphs connected with the root lattice
For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that ...
RN Yadav
doaj +3 more sources
Learning Embedding for Signed Network in Social Media with Hierarchical Graph Pooling
Signed network embedding concentrates on learning fixed-length representations for nodes in signed networks with positive and negative links, which contributes to many downstream tasks in social media, such as link prediction.
Jiawang Chen, Zhenqiang Wu
doaj +1 more source
The Nullity of Bicyclic Signed Graphs [PDF]
Let \Gamma be a signed graph and let A(\Gamma) be the adjacency matrix of \Gamma. The nullity of \Gamma is the multiplicity of eigenvalue zero in the spectrum of A(\Gamma).
Cheng B +7 more
core +1 more source
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL [PDF]
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients ...
E. Ghasemian, Gh. H. Fath-Tabar
doaj +1 more source
Total Minimal Dominating Signed Graph [PDF]
Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Zaslavsky, Thomas Zaslavsky
openaire +3 more sources
Signed degree sequences of signed graphs [PDF]
\textit{G. Chartrand}, \textit{H. Gavlas}, \textit{F. Harary} and \textit{M. Schultz} [Czech. Math. J. 44, No. 4, 677-690 (1994; Zbl 0837.05110)] asked whether \textit{S. L. Hakimi's} procedure [SIAM J. Appl. Math. 10, 496-506 (1962; Zbl 0109.16501)] for degree sequences in graphs also works for signed degree sequences.
David Kuo +3 more
openaire +3 more sources
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
On net-Laplacian energy of signed graphs
A signed graph is a graph where the edges are assigned either positive or negative signs. Net degree of a signed graph is the difference between the number of positive and negative edges incident with a vertex. It is said to be net-regular if all its
Nutan G. Nayak
doaj +1 more source

