Line Cut Vertex Digraphs of Digraphs

Line Cut Vertex Digraphs of Digraphs

In this paper we define the digraph valued function (digraph operator) namely, the line cut vertex digraph L^sub c^(D) of a digraph D. The problem of reconstructing a digraph from its line cut vertex digraph is presented. Also, outer planarity and maximal outer planarity properties of these digraphs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical combinatorics 2015-12, Vol.4, p.99-99
Hauptverfasser: Nagesh, H M, Chandrasekhar, R
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorial analysis
Combinatorics
Functions (mathematics)
Graph theory
Graphs
Mathematical analysis
Mathematical functions
Operators (mathematics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we define the digraph valued function (digraph operator) namely, the line cut vertex digraph L^sub c^(D) of a digraph D. The problem of reconstructing a digraph from its line cut vertex digraph is presented. Also, outer planarity and maximal outer planarity properties of these digraphs are discussed.
ISSN:1937-1055
1937-1047