Results 1  10
of
288
Symbolic Model Checking with Partitioned Transition Relations
, 1991
"... We significantly reduce the complexity of BDDbased symbolic verification by using partitioned transition relations to represent state transition graphs. This method can be applied to both synchronous and asynchronous circuits. The times necessary to verify a synchronous pipeline and an asynchronous ..."
Abstract

Cited by 181 (17 self)
 Add to MetaCart
We significantly reduce the complexity of BDDbased symbolic verification by using partitioned transition relations to represent state transition graphs. This method can be applied to both synchronous and asynchronous circuits. The times necessary to verify a synchronous pipeline
Finite twodistancetransitive graphs of valency 6
, 2015
"... A noncomplete graph Γ is said to be (G, 2)distancetransitive if, for i = 1, 2 and for any two vertex pairs (u1, v1) and (u2, v2) with dΓ(u1, v1) = dΓ(u2, v2) = i, there exists g ∈ G such that (u1, v1)g = (u2, v2). This paper classifies the family of (G, 2)distancetransitive graphs of valency ..."
Abstract
 Add to MetaCart
A noncomplete graph Γ is said to be (G, 2)distancetransitive if, for i = 1, 2 and for any two vertex pairs (u1, v1) and (u2, v2) with dΓ(u1, v1) = dΓ(u2, v2) = i, there exists g ∈ G such that (u1, v1)g = (u2, v2). This paper classifies the family of (G, 2)distancetransitive graphs of valency
Cayley Graphs and Interconnection Networks
, 1997
"... In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertextransitive graphs (see quasiCayley graphs in Section 5.3) or edgetransitive graphs (see regular orbital graphs in Section 5. ..."
Abstract

Cited by 68 (3 self)
 Add to MetaCart
In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertextransitive graphs (see quasiCayley graphs in Section 5.3) or edgetransitive graphs (see regular orbital graphs in Section 5.6
The diameter of sparse random graphs
 ADV. IN APPL. MATH
, 2001
"... We consider the diameter of a random graph G�n � p � for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of ..."
Abstract

Cited by 52 (1 self)
 Add to MetaCart
We consider the diameter of a random graph G�n � p � for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter
The diameter of random sparse graphs
, 2000
"... We consider the diameter of a random graph G(n, p) for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
We consider the diameter of a random graph G(n, p) for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter
Smith’s Theorem and a characterization of the 6cube as distancetransitive graph
 J ALGEBR COMB
, 2006
"... ..."
On Solvable Groups and Circulant Graphs
, 2000
"... Let ϕ be Euler’s phi function. We prove that a vertextransitive graph Ɣ of order n, with gcd(n, ϕ(n)) = 1, is isomorphic to a circulant graph of order n if and only if Aut(Ɣ) contains a transitive solvable subgroup. As a corollary, we prove that every vertextransitive graph Ɣ of order n is isomor ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is isomorphic to a circulant graph of order n if and only if for every such Ɣ, Aut(Ɣ) contains a transitive solvable subgroup and n = 4, 6, or gcd(n, ϕ(n)) = 1.
Igraphs and the corresponding configurations
 JOURNAL OF COMBINATORIAL DESIGNS
, 2004
"... We consider the class of Igraphs I(n, j, k), which is a generalization over the class of the generalized Petersen graphs. We study different properties of Igraphs such as connectedness, girth and whether they are bipartite or vertextransitive. We give an efficient test for isomorphism of Igraphs ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We consider the class of Igraphs I(n, j, k), which is a generalization over the class of the generalized Petersen graphs. We study different properties of Igraphs such as connectedness, girth and whether they are bipartite or vertextransitive. We give an efficient test for isomorphism of Igraphs
Homogeneous Factorisations of Johnson Graphs
, 2004
"... For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G,M)homogeneous factorisation if M is vertextransitive on Γ and fixes setwise each part of E, while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G,M)homogeneous factorisation if M is vertextransitive on Γ and fixes setwise each part of E, while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations
Probability on Graphs
"... Preface This is my licentiate thesis, summarizing my first two years as a PhDstudent. In general terms, the thesis deals with problems concerning probability models on combinatorial structures. The first paper considers the random assignment problem, the second firstpassage percolation. The third ..."
Abstract
 Add to MetaCart
) are isomorphic if there exists a bijection A graph is transitive if all vertices play the same role, i.e., for every pair of vertices, u and v, there is a graph isomorphism that maps u to v. 2 If the edge set of a graph G = (V, E) is a subset of the edge set of another graph G = (V , E ), we say that G is a
Results 1  10
of
288