Biased graphs. I. Bias, balance, and gains
Journal of Combinatorial Theory, Series B, 1989 AbstractA biased graph is a graph together with a class of cirles (simple closed paths), called balanced, such that no theta subgraph contains exactly two balanced circles. A gain graph is a graph in which each edge has a gain (a label from a group so that reversing the direction inverts the gain); a circle is balanced if its edge gain product is 1 ...
openaire +2 more sources
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry [PDF]
, 2005 Konstantin Rybnikov, Thomas Zasĺavsky
openalex +1 more source
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
, 2022 Pepijn Wissing, Edwin van Dam
openalex +1 more source
Spectral Characterizations of Complex Unit Gain Graphs
, 2022 While eigenvalues of graphs are well studied, spectral analysis of complex unit gain graphs is still in its infancy. This thesis considers gain graphs whose gain groups are gradually less and less restricted, with the ultimate goal of classifying gain graphs that are characterized by their spectra. In such cases, the eigenvalues of a gain graph contain
openaire +1 more source
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups [PDF]
, 2005 Konstantin Rybnikov, Thomas Zasĺavsky
openalex +1 more source
Indonesian Journal of Education and PedagogyThis action research aimed to enhance the graph interpretation skills of 35 Grade 9 Apitong students of Baybay National High School in learning microeconomics through the I2 strategy.
Jojenn P. Calingacion +5 more
doaj +1 more source
Graph neural network approach with spatial structure to anomaly detection of network data
Journal of Big DataNetwork anomaly detection using graph-structured data is a critical task in data mining and cybersecurity, involving the identification of unusual patterns within a network by analyzing its structure as a graph.
Hao Zhang +5 more
doaj +1 more source
Totally frustrated states in the chromatic theory of gain graphs
European Journal of Combinatorics, 2009 We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of `qualities' or `spins' that is permuted by the gain group. (An example is the Potts model.) The number of totally frustrated states satisfies the usual deletion-contraction law but is matroidal only for standard coloring, where the ...
openaire +3 more sources
Distributed Adaptive Consensus Output Tracking Problem of Nonlinear Multi-Agent Systems with Unknown High-Frequency Gain Signs under Directed Graphs [PDF]
, 2023 Jingyu Chen, Zhengtao Ding
openalex +1 more source
A Text Classification Method Based on Combination of Information Gain and Graph Clustering
International Journal of Information and Communication Technology Research, 2019 Text classification has a wide range of applications such as: spam filtering, automated indexing of scientific articles, identifying the genre of documents, news monitoring, and so on.
Alireza Abdollahpouri +3 more
doaj