Results 11 to 20 of about 841,611 (282)
Normalized Laplacians for gain graphs [PDF]
The American Journal of Combinatorics, 2022 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
NEPS of complex unit gain graphs
The Electronic Journal of Linear Algebra, 2023 A complex unit gain graph (or $\mathbb T$-gain graph) is a gain graph with gains in $\mathbb T$, the multiplicative group of complex units. Extending a classical construction for simple graphs due to Cvektovic, suitably defined noncomplete extended $p$-sums (NEPS, for short) of $\mathbb T$-gain graphs are considered in this paper. Structural properties
Francesco Belardo +2 more
openalex +4 more sources
Spectral properties of complex unit gain graphs [PDF]
Linear Algebra and its Applications, 2012 13 pages, 1 figure, to appear in Linear Algebra ...
Nathan Reff
openalex +4 more sources
Gain distance matrices for complex unit gain graphs [PDF]
Discrete Mathematics, 2021 A complex unit gain graph ($ \mathbb{T} $-gain graph), $ =(G, ) $ is a graph where the function $ $ assigns a unit complex number to each orientation of an edge of $ G $, and its inverse is assigned to the opposite orientation. %A complex unit gain graph($ \mathbb{T} $-gain graph) is a simple graph where each orientation of an edge is given a ...
Aniruddha Samanta, M. Rajesh Kannan
openalex +4 more sources
Privacy-preserving and verifiable spectral graph analysis in the cloud [PDF]
Scientific ReportsResorting to cloud computing for spectral graph analysis on large-scale graph data is becoming increasingly popular. However, given the intrusive and opaque natures of cloud services, privacy, and misbehaving cloud that returns incorrect results have ...
Yuzhao Song
doaj +2 more sources
A switching method for constructing cospectral gain graphs
Discrete Mathematics, 2023 A gain graph over a group $G$, also referred to as $G$-gain graph, is a graph where an element of a group $G$, called gain, is assigned to each oriented edge, in such a way that the inverse element is associated with the opposite orientation. Gain graphs can be regarded as a generalization of signed graphs, among others.
Aida Abiad +2 more
openalex +5 more sources
A group representation approach to balance of gain graphs [PDF]
Journal of Algebraic Combinatorics, 2020 We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their adjacency matrices in $M_n(\mathbb C G)$.
Matteo Cavaleri +2 more
openalex +5 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.
Daniele D'Angeli +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
Modeling sleep modes gains with random graphs [PDF]
2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2011 Nowadays two main approaches are being pursued to reduce energy consumption of network devices: the use of sleep modes in which devices can be put in low-power state, and the adoption of energy proportional approaches where the device architecture is designed to make energy consumption proportional to the actual load.
Luca Chiaraviglio +3 more
openalex +4 more sources