Results 11 to 20 of about 2,163,558 (289)
The determinant of the Laplacian matrix of a quaternion unit gain graph
16 pages, 1 ...
Ivan Kyrchei
exaly +5 more sources
Characterizations of line graphs in signed and gain graphs [PDF]
We generalize three classical characterizations of line graphs to line graphs of signed and gain graphs: the Krausz's characterization, the van Rooij and Wilf's characterization and the Beineke's characterization. In particular, we present a list of forbidden gain subgraphs characterizing the class of gain-line graphs.
Matteo Cavaleri +2 more
openaire +3 more sources
Gain distance matrices for complex unit gain graphs
20 pages; 2 ...
Aniruddha Samanta, M. Rajesh Kannan
openaire +6 more sources
Matroids of Gain Signed Graphs
13 fig., 46 pp. v2 has new Example 3.7, minor editing, 47 pp.
Laura Anderson +2 more
openaire +2 more sources
Experimental and bond graph based sensitivity calculations for micro-scale robust engineering design [PDF]
Copyright @ 2005 IEEEBond graph modeling and sensitivity analysis are used to provide a platform for the robust design of a small mechatronic device, a behind-the-ear (BTE) hearing aid.
Wynn, HP +5 more
core +6 more sources
Burnside Chromatic Polynomials of Group-Invariant Graphs
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
Graph products of groups [PDF]
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +7 more sources
Domain Entity Extraction Method Based on Graph Sorting and Maximal Information Gain [PDF]
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
A dual‐modal graph attention interaction network for person Re‐identification
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
On the Fractionalization of the Shift Operator on Graphs
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

