Skip to main navigation Skip to search Skip to main content

NEPS of complex unit gain graphs

  • Francesco Belardo
  • , Maurizio Brunetti*
  • , Suliman Khan
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

A complex unit gain graph (or T-gain graph) is a gain graph with gains in T, the multiplicative group of complex units. Extending a classical construction for simple graphs due to Cvektović, suitably defined noncomplete extended p-sums (NEPS, for short) of T-gain graphs are considered in this paper. Structural properties of NEPS like balance and some spectral properties and invariants of their adjacency and Laplacian matrices are investigated, including the energy and the possible symmetry of the adjacency spectrum. It is also shown how NEPS are useful to obtain infinitely many integral graphs from the few at hands. Moreover, it is studied how NEPS of T-gain graphs behave with respect to the property of being nut, i.e., having 0 as simple adjacency eigenvalue and nowhere zero 0-eigenvectors. Finally, a family of new products generalizing NEPS is introduced, and their few first spectral properties explored.

Original languageEnglish
Pages (from-to)621-643
Number of pages23
JournalElectronic Journal of Linear Algebra
Volume39
DOIs
StatePublished - 9 Feb 2023
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2023, International Linear Algebra Society. All rights reserved.

Keywords

  • Gain graph
  • NEPS
  • Products

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint

Dive into the research topics of 'NEPS of complex unit gain graphs'. Together they form a unique fingerprint.

Cite this