Results 21 to 30 of about 904,948 (308)
Bounds and extremal graphs for the energy of complex unit gain graphs [PDF]
Linear Algebra and its Applications, 2023 A complex unit gain graph ($ \mathbb{T} $-gain graph), $ Φ=(G, φ) $ is a graph where the gain function $ φ$ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite orientation. The associated adjacency matrix $ A(Φ) $ is defined canonically. The energy $ \mathcal{E}(Φ) $ of a $ \mathbb{T} $-gain
Aniruddha Samanta, M. Rajesh Kannan
openalex +3 more sources
Gain-line graphs via G-phases and group representations [PDF]
Linear Algebra and its Applications, 2020 Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $( , )$ through the choice of an incidence $G$-phase matrix inducing $ $. We prove that the switching equivalence class of the gain function on the line graph $L( )$ does not change if one chooses a different $G$-phase inducing $ $ or a different representative of the ...
Matteo Cavaleri +2 more
openalex +4 more sources
Characterizations of line graphs in signed and gain graphs [PDF]
European Journal of Combinatorics, 2022 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.
Cavaleri, Matteo +2 more
openaire +3 more sources
Gain distance Laplacian matrices for complex unit gain graphs [PDF]
18 pages, 1 ...
Suliman Khan
openalex +3 more sources
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
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
Certain operations on interval-valued picture fuzzy graphs with application
International Journal of Mathematics for Industry, 2023 Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari +3 more
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
A Hierarchical Parallel Graph Summarization Approach Based on Ranking Nodes
Applied Sciences, 2023 Graph summarization techniques are vital in simplifying and extracting enormous quantities of graph data. Traditional static graph structure-based summarization algorithms generally follow a minimum description length (MDL) style, and concentrate on ...
Qiang Liu, Jiaxing Wei, Hao Liu, Yimu Ji
doaj +1 more source