Paper Info
Title
Characterization of unigraphic and unidigraphic integer-pair sequences
Abstract
Given a graph (digraph) G with edge (arc) set E(G) = {(u\"1}, @u\"1), (u\"2, @u\"2),...,(u\"q, @u\"q, where q = |E(G)|, we can associate with it an integer-pair sequence S\"G = ((a\"1, b\"1), (a\"2, b\"2),..., (a\"q, b\"q)) where a\"i, b\"i are the degrees (indegrees) of u\"i, @u\"i respectively. An integer- pair sequence S is said to be graphic (digraphic) if there exists a graph (digraph) G such that \"S\"G = S. In this paper we characterize unigraphic and unidigraphic integer-pair sequences.
Year
DOI
Venue
1981
10.1016/0012-365X(81)90139-4
Discrete Mathematics
Field
DocType
Volume
Integer,Discrete mathematics,Graph,Combinatorics,Existential quantification,Mathematics,Digraph
Journal
37
Issue
ISSN
Citations 
1
Discrete Mathematics
2
PageRank 
References 
Authors
0.50
3
1
Name
Order
Citations
PageRank
Prabir Das1165.20