Results 261 to 270 of about 180,088 (293)
Some of the next articles are maybe not open access.

Lock-Gain Based Graph Partitioning

Journal of Heuristics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Byung-Ro Moon   +2 more
exaly   +2 more sources

GRAPHS DETERMINED BY THEIR -GAIN SPECTRA

Bulletin of the Australian Mathematical Society, 2020
AbstractAn undirected graph $G$ is determined by its $T$-gain spectrum (DTS) if every $T$-gain graph cospectral to $G$ is switching equivalent to $G$. We show that the complete graph $K_{n}$ and the graph $K_{n}-e$ obtained by deleting an edge from $K_{n}$ are DTS, the star $K_{1,n}$ is DTS if and only if $n\leq 2$, and an odd path $P_{2m+1}$ is not ...
SAI WANG, DEIN WONG, FENGLEI TIAN
openaire   +1 more source

On the structure of matroids arising from the gain graphs

Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamid Reza Maimani   +3 more
openaire   +2 more sources

The rank of a complex unit gain graph in terms of the rank of its underlying graph [PDF]

open access: yesJournal of Combinatorial Optimization, 2019
Let $Φ=(G, φ)$ be a complex unit gain graph (or $\mathbb{T}$-gain graph) and $A(Φ)$ be its adjacency matrix, where $G$ is called the underlying graph of $Φ$. The rank of $Φ$, denoted by $r(Φ)$, is the rank of $A(Φ)$. Denote by $θ(G)=|E(G)|-|V(G)|+ω(G)$ the dimension of cycle spaces of $G$, where $|E(G)|$, $|V(G)|$ and $ω(G)$ are the number of edges ...
Ligong Wang   +2 more
exaly   +3 more sources

Inertia of complex unit gain graphs

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guihai Yu, Hui Qu, Jianhua Tu
openaire   +1 more source

Spectra of quaternion unit gain graphs

Linear Algebra and its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belardo F.   +4 more
openaire   +2 more sources

Subgroup Switching of Skew Gain Graphs

Fundamenta Informaticae, 2012
Gain graphs are graphs in which each edge has a gain (a label from a group so that reversing the direction of an edge inverts the gain). In this paper we take a generalized view of gain graphs in which the gain of an edge is related to the gain of the reverse edge by an anti-involution, i.e., an anti-automorphism of order at most two.
openaire   +3 more sources

Home - About - Disclaimer - Privacy