S. Even
A. Pnueli
- 1 PAULL, M. C., AND UN(~ER, S. It. Minimizing the immber of states in incompletely speeifled sequential switching functions. IRE Trans. on Electronic Computers EC-8, 3 (Sept. 1959), 360.Google Scholar
- 2 KNUTH, D. E. The Arl of Compuler Programming, Volume 1: Fu~'~damenlal Algorithms. Addison-Wesley, Reading, Mass., 1968, See. 2.2.2. Google Scholar
- 3 LIu, C. L. Introduction to Combinatorial Malhemalics. McGraw-Hill, New York, 1968, Ch. 9, Ex. 9-5.Google Scholar
- 4 PNUELI, A., LEMPEL, A., AND EVEN, S. Transitive orientation of graphs and identification of permutation graphs. Canad. J. Malh. 23 (1971), 160 175.Google Scholar
Index Terms
- Permutation Graphs and Transitive Graphs
Recommendations
Connectivity of vertex and edge transitive graphs
A graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph is said to be hyper-connected if each minimum vertex cut creates exactly two components, one of which is an isolated vertex. It is proved that a connected ...
Super-connected edge transitive graphs
A graph G is said to be super-connected if any minimum cut of G isolates a vertex. In a previous work due to the second author of this note, super-connected graphs which are both vertex transitive and edge transitive are characterized. In this note, we ...
Optimally super-edge-connected transitive graphs
Let X=(V,E) be a connected regular graph. X is said to be super-edge-connected if every minimum edge cut of X is a set of edges incident with some vertex. The restricted edge connectivity λ'(X) of X is the minimum number of edges whose removal ...
Comments