Line digraphs and coreflexive vertex sets

DOI10.1016/S0012-365X(98)00022-3zbMATH Open0957.05049arXivmath/9802065MaRDI QIDQ1584342FDOQ1584342

Authors: Xinming Liu, Douglas B. West 

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection digraph from a given digraph.

Full work available at URL: https://arxiv.org/abs/math/9802065

Recommendations

• scientific article; zbMATH DE number 4156491
• scientific article; zbMATH DE number 4200231
• scientific article; zbMATH DE number 3900786
• scientific article; zbMATH DE number 3885939
• scientific article; zbMATH DE number 1185600

zbMATH Keywords

characterizationsline digraphsintersection digraphcoreflexive set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Cites Work

• Interval digraphs: An analogue of interval graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Precedence Constraints and Arrow Diagrams
• Arrow Diagrams are Line Digraphs
• Some properties of line digraphs
• Title not available (Why is that?)
• Connection digraphs and second-order line digraphs

Cited In (4)

• A survey of line digraphs and generalizations
• Title not available (Why is that?)
• \(n\)-dimensional line digraphs
• Miscellaneous digraph classes

This page was built for publication: Line digraphs and coreflexive vertex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584342)