Results 11 to 20 of about 37,702 (263)

Signed random walk diffusion for effective representation learning in signed graphs. [PDF]

open access: yesPLoS ONE, 2022
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   +3 more sources

SUM SIGNED GRAPHS – II

open access: yesUral Mathematical Journal, 2023
In this paper, the study of sum signed graphs is continued. The balancing and switching nature of the graphs are analyzed. The concept of  \(rna\) number is revisited and an important relation between the number and its complement is established.
Athira P. Ranjith   +1 more
doaj   +3 more sources

On Laplacian Equienergetic Signed Graphs [PDF]

open access: yesJournal of Mathematics, 2021
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj   +3 more sources

Signed distance in signed graphs [PDF]

open access: yesLinear Algebra and its Applications, 2021
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the distance spectrum of some unbalanced signed graphs.
Shahul K. Hameed   +4 more
openaire   +2 more sources

On Characterization of Balance and Consistency Preserving d-Antipodal Signed Graphs

open access: yesMathematics, 2023
A signed graph is an ordered pair Σ=(G,σ), where G is a graph and σ:E(G)⟶{+1,−1} is a mapping. For e∈E(G), σ(e) is called the sign of e and for any sub-graph H of G, σ(H)=∏e∈E(H)σ(e) is called the sign of H.
Kshittiz Chettri, Biswajit Deb
doaj   +1 more source

Additively graceful signed graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
Let [Formula: see text] be a signed graph of order p and size q. Let [Formula: see text] and [Formula: see text] Let [Formula: see text] be an injective function and let [Graphic: see text]gf(uv)={|f(u)−f(v)| if uv∈E+f(u)+f(v) if uv∈E−The function f is ...
Jessica Pereira   +2 more
doaj   +1 more source

More Equienergetic Signed Graphs [PDF]

open access: yesMathematics Interdisciplinary Research, 2017
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy.
Harishchandra S. ‎Ramane   +1 more
doaj   +1 more source

Signed degree sets in signed graphs [PDF]

open access: yesCzechoslovak Mathematical Journal, 2007
The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph.
Pirzada, S., Naikoo, T. A., Dar, F. A.
openaire   +2 more sources

Product Signed Domination in Graphs

open access: yesRatio Mathematica, 2022
Let  be a simple graph. The closed neighborhood of , denoted by , is the set . A function  is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . .
T M Velammal, A Nagarajan, K Palani
doaj   +1 more source

Star complements in signed graphs with two symmetric eigenvalues

open access: yesKuwait Journal of Science, 2022
We consider signed graphs $G$ whose spectrum is comprised of exactly two (distinct) eigenvalues that differ only in sign, abbreviated to signed graphs with two symmetric eigenvalues. We obtain some relationships between such signed graphs and their star
Assoc. Prof, Zoran Stanić
doaj   +1 more source

Home - About - Disclaimer - Privacy