Line digraphs and coreflexive vertex sets

DOI10.1016/S0012-365X(98)00022-3MaRDI QIDQ1584342zbMATH OpenFDO

Authors Xinming Liu, Douglas B. West

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

characterizationsline digraphsintersection digraphcoreflexive set

Mathematics Subject Classification ID

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

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.

Cites work

• scientific article; zbMATH DE number 3815694 (Why is no real title available?)
• scientific article; zbMATH DE number 3675952 (Why is no real title available?)
• scientific article; zbMATH DE number 3218572 (Why is no real title available?)
• Arrow Diagrams are Line Digraphs
• Connection digraphs and second-order line digraphs
• Interval digraphs: An analogue of interval graphs
• Precedence Constraints and Arrow Diagrams
• Some properties of line digraphs

Cited in

(4)

• A survey of line digraphs and generalizations
• scientific article; zbMATH DE number 4156491 (Why is no real title available?)
• 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)