Results 21 to 30 of about 841,611 (282)
On the Characteristic Polynomial of Skew Gain Graphs
, 2020 Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew gain graphs have the property that the gain of a reversed edge is the image of edge gain under an anti-involution.
Shahul Hameed K +3 more
openalex +4 more sources
Oriented gain graphs, line graphs and eigenvalues [PDF]
Linear Algebra and its Applications, 2016 A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of gain graphs with complex units, matrix properties are established.
Nathan Reff
openalex +4 more sources
Matroids of Gain Signed Graphs
Discrete & Computational Geometry, 2023 13 fig., 46 pp. v2 has new Example 3.7, minor editing, 47 pp.
Laura Anderson +2 more
openaire +2 more sources
Godsil-McKay switchings for gain graphs
The Electronic Journal of Linear AlgebraWe introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs of $G$-cospectral gain graphs, that are gain graphs cospectral with respect to every representation of the gain group $G$. For instance, for two signed graphs, this notion of cospectrality is equivalent to the cospectrality of their signed adjacency ...
Matteo Cavaleri +2 more
openalex +3 more sources
Incidence Gain Graphs and Generalized Quadrangles [PDF]
We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized quadrangle provided that the gain function satisfies a certain bijective property.
Ryan McCulloch
openalex +3 more sources
On the spectrum of complex unit gain graph
, 2019 A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is called $\mathbb{T}$-gain adjacency matrix.
Aniruddha Samanta, M. Rajesh Kannan
openalex +4 more sources
Burnside Chromatic Polynomials of Group-Invariant Graphs
Discussiones Mathematicae Graph Theory, 2023 We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs.
White Jacob A.
doaj +1 more source
Bounds for the energy of a complex unit gain graph [PDF]
Linear Algebra and its Applications, 2021 A $\mathbb{T}$-gain graph, $ = (G, )$, is a graph in which the function $ $ assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix $ A( ) $ is defined canonically.
Aniruddha Samanta, M. Rajesh Kannan
openaire +3 more sources
On the Fractionalization of the Shift Operator on Graphs
IEEE Access, 2022 The theory of graph signal processing has been established with the purpose of generalizing tools from classical digital signal processing to the cases where the signal domain can be modeled by an arbitrary graph.
Guilherme B. Ribeiro +2 more
doaj +1 more source
A dual‐modal graph attention interaction network for person Re‐identification
IET Computer Vision, 2023 Person Re‐identification (Re‐ID) is a task of matching target pedestrians under cross‐camera surveillance. Learning discriminative feature representations is the main issue for person Re‐ID.
Wen Wang, Gaoyun An, Qiuqi Ruan
doaj +1 more source