Results 101 to 110 of about 2,268 (146)

Balanced decompositions of a signed graph

, 1987
The balanced decomposition number (b.d.n.) δ0(Σ) of a signed graph Σ is the smallest number of balanced subsets into which its edges can be partitioned. (A special case is decomposition of a graph into bipartite subgraphs.) The connected b.d.n.
Zasĺavsky, Thomas
core   +1 more source

Student Learning Outcome Prediction via Sheaflet-Based Graph Learning and LLM

Applied Sciences
Accurately modeling the interactions between students and learning content is a central challenge in achieving personalized and adaptive learning in online education.
Dongmei Zhang, Zhanle Zhu, Yukang Cheng, Yongchun Gu   +3 more
doaj   +1 more source

Signed graphs with strong (anti-)reciprocal eigenvalue property

Special Matrices
A (signed) graph is said to exhibit the strong reciprocal (anti-reciprocal) eigenvalue property (SR) (resp., (-SR)) if for any eigenvalue λ\lambda , it has 1λ\frac{1}{\lambda } (resp.,−1λ-\frac{1}{\lambda }) as an eigenvalue as well, with the same ...
Belardo Francesco, Huntington Callum
doaj   +1 more source

How colorful the signed graph?

, 1984
The zero-free chromatic number χ∗ of a signed graph ∑ is the smallest positive number k for which the vertices can be colored using ±1, ±2,…,±k so that endpoints of a positive edge are not colored the same and those of a negative edge are not colored ...
Zaslavsky, Thomas
core   +1 more source

Decomposition of a signed graph into strongly connected components and its signed poset structure

, 1994
A signed graph (or a bidirected graph) is a graph whose each arc has either two positive end-vertices (tails), two negative end-vertices (heads), or one positive end-vertex (a tail) and one negative end vertex (a head).
Ando, K., Nemoto, T. (Tsukuba Univ., Ibaraki (Japan). Inst. of Socio-Economic Planning), Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research, Fujishige, S. (Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research)   +3 more
core  

Structure Balance and Gradient Matching-Based Signed Graph Condensation

Training graph neural networks (GNNs) for graph representation has received increasing concerns due to its outstanding performance in the link prediction and node classification tasks, but it incurs much time and storage for tackling large-scale graphs ...
Li, Rong, Xu, Long, Ji, Junkai, Liu, Songbai, Ma, Lijia, Li, Lingjie, Lin, Qiuzhen   +6 more
core   +1 more source

Interpretable Signed Link Prediction With Signed Infomax Hyperbolic Graph

Signed link prediction in social networks aims to reveal the underlying relationships (i.e., links) among users (i.e., nodes) given their existing positive and negative interactions observed.
Baktashmotlagh, M, Huang, Z, Yang, Y, Luo, Y, Chen, H, Yin, H   +5 more
core   +1 more source

RESOLUTION OF IRREDUCIBLE INTEGRAL FLOWS ON A SIGNED Graph

, 2007
We completely describe the structure of irreducible integral flows on a signed graph by lifting them to the signed double covering ...
Beifang Chen, Thomas Zaslavsky, Jue Wang
core  

A signed graph product and its Application

A signed graph product is defined for a new product, and initially the unsigned graph product's Laplacian spectrum and signless Laplacian spectrum are found.
Sonar, Bishal, Srivastava, Ravi
core  

Bounds on the signed domination number of a graph.

, 2001
Let G = (V, E) be a simple graph on vertex set V and define a function f: V →{−1, 1}. The function f is a signed dominating function if for every vertex x ∈ V, the closed neighborhood of x contains more vertices with function value 1 than with −1.
Ruth Haas, Thomas B. Wexler
core