Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Maximal Line Digraphs
View through CrossRef
ABSTRACT
A line digraph is the digraph constructed from the digraph such that there is an arc in if the terminal node of in is the initial node of . The maximum number of arcs in a line digraph with nodes is if is even, and otherwise. For , there is only one line digraph with as many arcs if is even, and if is odd, there are two line digraphs, each being the transpose of the other.
Title: Maximal Line Digraphs
Description:
ABSTRACT
A line digraph is the digraph constructed from the digraph such that there is an arc in if the terminal node of in is the initial node of .
The maximum number of arcs in a line digraph with nodes is if is even, and otherwise.
For , there is only one line digraph with as many arcs if is even, and if is odd, there are two line digraphs, each being the transpose of the other.
Related Results
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
AbstractFradkin and Seymour (J Comb Theory Ser B 110:19–46, 2015) defined the class of digraphs of bounded independence number as a generalization of the class of tournaments. They...
Efficient Open Domination in Digraph Products
Efficient Open Domination in Digraph Products
A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partitio...
On link-irregular digraphs
On link-irregular digraphs
We extend the study of link-irregular graphs to directed graphs (digraphs), where a digraph is link-irregular if no two vertices have isomorphic directed links. We establish that l...
On the Aα spectral radius of generalized weighted digraphs
On the Aα spectral radius of generalized weighted digraphs
Let G = (V(G), E(G)) be a generalized weighted digraph without loops and multiple arcs, where the weight of each arc is a nonnegative and symmetric matrix of same order p. For vi ?...
Pure Maximal Submodules and Related Concepts
Pure Maximal Submodules and Related Concepts
In this work we discuss the concept of pure-maximal denoted by (Pr-maximal) submodules as a generalization to the type of R- maximal submodule, where a proper submodule of a...
Islet β-Cell Function Following 4.4-Year Insulin Injection in Chinese Elderly Patients with Type 2 Diabetes Mellitus
Islet β-Cell Function Following 4.4-Year Insulin Injection in Chinese Elderly Patients with Type 2 Diabetes Mellitus
Abstract
Background The aim of this study was to scrutinize changes of islet β-cell function in Chinese elderly patients with type 2 diabetes mellitus (T2DM) after insulin ...