Skip to content
naulon

Not checkedNot checked for notices yet.

New results and open problems in line graphs

Jay Bagga, Lowell Beineke

AKCE International Journal of Graphs and Combinatorics · 2022

doi:10.1080/09728600.2022.2093146 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

AbstractGiven a graph G with at least one edge, the line graph L(G) is that graph whose vertices are the edges of G, with two of these vertices being adjacent if the corresponding edges are adjacent in G. The line graph transformation is one of the most extensively studied, and the concept extends naturally to digraphs. The authors have recently published a book Line Graphs and Line Digraphs that covers many properties and generalizations of both types of structure. In this paper we discuss some recent progress in this area. We include a discussion of several recognition algorithms related to line graphs, and some new results on the line completion numbers. We also present some open problems and directions for further research.

Abstract licence: CC BY-NC

References24

    24 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.