English

Characterizations of line graphs in signed and gain graphs

Combinatorics 2021-11-23 v2

Abstract

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. In the case of a signed graph whose underlying graph is a line graph, this list consists of exactly four signed graphs. Under the same hypothesis, we prove that a signed graph is the line graph of a signed graph if and only if its eigenvalues are either greater than 2-2, or less than 22, depending on which particular definition of line graph is adopted.

Keywords

Cite

@article{arxiv.2101.09677,
  title  = {Characterizations of line graphs in signed and gain graphs},
  author = {Matteo Cavaleri and Daniele D'Angeli and Alfredo Donno},
  journal= {arXiv preprint arXiv:2101.09677},
  year   = {2021}
}

Comments

25 pages, 10 figures. Accepted for publication in European Journal of Combinatorics