Recognizing signed line graphs with a single root

A signed line graph of a simply signed graph extends the notion of a generalized line graph defined in the framework of ordinary graphs. In this paper, the Krausz theorem on covering characterization of line graphs and the Whitney theorem on isomorphism are extended to the context of signed line graphs.

Authors

Institutions

Publication Details

Journal
Applicable Analysis and Discrete Mathematics
Published
2025-01-01
DOI
https://doi.org/10.2298/aadm250525019s
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Recognizing signed line graphs with a single root

Zoran Stanić
Applicable Analysis and Discrete Mathematics
graph theory and CDMA systems
article

Recognizing signed line graphs with a single root

Zoran Stanić
article en

Abstract

A signed line graph of a simply signed graph extends the notion of a generalized line graph defined in the framework of ordinary graphs. In this paper, the Krausz theorem on covering characterization of line graphs and the Whitney theorem on isomorphism are extended to the context of signed line graphs.

Applicable Analysis and Discrete MathematicsVol. 19(2)
University of Belgrade (RS)
Openalex Percentile: Top 74%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Recognizing signed line graphs with a single root — Zoran Stanić · Applicable Analysis and Discrete Mathematics (2025) | TGRS Research Map | TGRS