Results 11 to 20 of about 176,563 (257)
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
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
Domain Entity Extraction Method Based on Graph Sorting and Maximal Information Gain [PDF]
Jisuanji gongcheng, 2022 Domain knowledge graphs play an important role in various industries, and the acquisition of the domain entity is an important basis for their construction.However, existing approaches frequently rely on human work such as data annotation and the ...
ZHANG Xiaoming, ZHENG Lixin, WANG Huiyong
doaj +1 more source
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
Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝕋4 = {±1, ±i} be the subgroup of 4-th roots of unity inside 𝕋, the multiplicative group of complex units. A complex unit gain graph Φ is a simple graph Γ = (V (Γ) = {v1, . . .
Belardo Francesco +2 more
doaj +1 more source
Coloring permutation-gain graphs
Contributions to Discrete Mathematics, 2021 Correspondence colorings of graphs were introduced in 2018 by Dvořák and Postle as a generalization of list colorings of graphs which generalizes ordinary graph coloring. Kim and Ozeki observed that correspondence colorings generalize various notions of signed-graph colorings which again generalizes ordinary graph colorings.
openaire +2 more sources
A Matrix Approach for Analyzing Signal Flow Graph
Information, 2020 Mason’s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n − 2)! permutation of the intermediate vertices includes a path between input and output nodes.
Shyr-Long Jeng +2 more
doaj +1 more source
Density Gain-Rate Peaks for Spectral Clustering
IEEE Access, 2021 Clustering has been troubled by varying shapes of sample distributions, such as line and spiral shapes. Spectral clustering and density peak clustering are two feasible techniques to address this problem, and have attracted much attention from academic ...
Jiexing Liu, Chenggui Zhao
doaj +1 more source
New Journal of Physics, 2021 Non-Hermitian (NH) topological states, such as the doubly-degenerate nodes dubbed as exceptional points (EPs) in Bloch band structure of 2D lattices driven by gain and loss, have attracted much recent interest.
Hang Liu, Sheng Meng, Feng Liu
doaj +1 more source