2009Discrete MathematicsRequires access

Double vertex digraphs of digraphs

GaoYubin, ShaoYanling

Open publisher page 0 citations

Abstract

Let D be a digraph of order n. The double vertex digraph S2(D) of D is the digraph whose vertex set consists of all ordered pairs of distinct vertices of V(D) such that there is an arc in S2(D) f...

About this research paper

What this paper is about

Let D be a digraph of order n. The double vertex digraph S2(D) of D is the digraph whose vertex set consists of all ordered pairs of distinct vertices of V(D) such that there is an arc in S2(D) f...

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let D be a digraph of order n. The double vertex digraph S2(D) of D is the digraph whose vertex set consists of all ordered pairs of distinct vertices of V(D) such that there is an arc in S2(D) f...

Key concepts: Digraph, Combinatorics, Vertex (graph theory), Mathematics, Order (exchange), Discrete mathematics, Graph, Economics

Related papers

Back to paper searchBrowse research topicsOriginal source
Double vertex digraphs of digraphs — Research Paper | ScholarLens