Results 11 to 20 of about 180,088 (293)
Normalized Laplacians for gain graphs [PDF]
We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graph $\Phi$ and study its properties in detail, providing insights and counterexamples along the way.
M. Rajesh Kannan +2 more
doaj +5 more sources
Line and Subdivision Graphs Determined by
Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on ...
Abdullah Alazemi +4 more
doaj +2 more sources
Coloring permutation-gain graphs
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.
Slilaty, Daniel
core +3 more sources
Balance in gain graphs – A spectral analysis
A gain graph is a graph 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.
Germina, K.A. +3 more
core +2 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 +5 more sources
Spectral Properties of Dual Unit Gain Graphs
In this paper, we study dual quaternion, dual complex unit gain graphs, and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications in robotics and
Chunfeng Cui +3 more
core +3 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
Gain distance Laplacian matrices for complex unit gain graphs
A complex unit gain graph (or a $\mathbb{T}$-gain graph) $\Theta(\Sigma,\varphi)$ is a graph where the unit complex number is assign by a function $\varphi$ to every oriented edge of $\Sigma$ and assign its inverse to the opposite orientation.
Khan, Suliman
core +2 more sources
A Matrix Approach for Analyzing Signal Flow Graph
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

