Paper Info
Title
Packing of graphs and permutations
Abstract
An embedding of a graph G (into its complement G) is a permutation Δ on V(G) such that if an edge xy belongs to E(G) then Δ(x)Δ(y) does not belong to E(G). If there exists an embedding of G we say that G is embeddable or that there is a packing of two copies of the graph G into complete graph Kn.
Year
DOI
Venue
2000
10.1016/S1571-0653(05)80194-5
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
packing of graphs,self-complementary graphs,permutation (structure)
Discrete mathematics,Combinatorics,Strongly regular graph,Vertex-transitive graph,Bound graph,Graph power,Graph embedding,Book embedding,Symmetric graph,Mathematics,Complement graph
Journal
Volume
ISSN
Citations 
5
1571-0653
0
PageRank 
References 
Authors
0.34
9
1
Name
Order
Citations
PageRank
Mariusz Woźniak120434.54