Abstract
Let Φ=(Γ,φ) be a T-gain graph or a complex unit gain graph and A(Φ) be its adjacency matrix. The rank of (Γ,φ) is denoted by r(Γ,φ) which is the rank of its adjacency matrix. If the underlying graph Γ of Φ has at least one cycle, then the girth of Φ is denoted by gr(Γ) or simply by gr, which is the length of the shortest cycle in Γ. In this paper, we prove r(Γ,φ)≥gr−2 for a T-gain graph (Γ,φ). Moreover, we characterize T-gain graphs satisfy r(Γ,φ)=gr−2 and r(Γ,φ)=gr.
| Original language | English |
|---|---|
| Pages (from-to) | 232-243 |
| Number of pages | 12 |
| Journal | Linear Algebra and Its Applications |
| Volume | 688 |
| DOIs | |
| State | Published - 1 May 2024 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2024 Elsevier Inc.
Keywords
- Cyclomatic number
- Girth
- Rank
- T-gain graph
ASJC Scopus subject areas
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'On connected T-gain graphs with rank equal to girth'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver