Connected permutation graphs
نویسندگان
چکیده
A permutation graph is a simple graph associated with a permutation. Let cn be the number of connected permutation graphs on n vertices. Then the sequence {cn} satisfies an interesting recurrence relation such that it provides partitions of n! as n! =nk=1 ck · (n− k)!. We also see that, if uniformly chosen at random, asymptotically almost all permutation graphs are connected. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Random Generation and Enumeration of Bipartite Permutation Graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the number, a simple algorithm that generates a connected bipartite permutation graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected bipartite permutation graphs is proposed....
متن کاملInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Given two graphs G and H as input, the Induced Subgraph Isomorphism (ISI) problem is to decide whether G has an induced subgraph that is isomorphic to H. This problem is NP-complete already when G and H are restricted to disjoint unions of paths, and consequently also NP-complete on proper interval graphs and on bipartite permutation graphs. We show that ISI can be solved in polynomial time on ...
متن کاملOn the linear structure and clique-width of bipartite permutation graphs
Bipartite permutation graphs have several nice characterizations in terms of vertex ordering. Besides, as AT-free graphs, they have a linear structure in the sense that any connected bipartite permutation graph has a dominating path. In the present paper, we elaborate the linear structure of bipartite permutation graphs by showing that any connected graph in the class can be stretched into a "p...
متن کاملChannel graphs of bit permutation networks
Channel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit permutation network has a unique channel graph if and only if it is connected, and two connected bit permutation networks are isomorphic if and only if their channel graphs are isomorphic. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007