Name
Abstract | ||
|---|---|---|
Let q be a prime power, 𝔽q be the field of q elements, and k, m be positive integers. A bipartite graph G = Gq(k, m) is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over 𝔽q, with two vertices (p1, p2) ∈ P and [ l1, l2] ∈ L being adjacent if and only if p2 + l2 = p 1kl 1m. We prove that graphs Gq(k, m) and Gq′(k′, m′) are isomorphic if and only if q = q′ and {gcd (k, q - 1), gcd (m, q - 1)} = {gcd (k′, q - 1),gcd (m′, q - 1)} as multisets. The proof is based on counting the number of complete bipartite INFgraphs in the graphs. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 322–328, 2005 |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1002/jgt.v48:4 | Journal of Graph Theory |
Keywords | Field | DocType |
bipartite graph,vector space,graph isomorphism | Complete bipartite graph,Topology,Discrete mathematics,Combinatorics,Vertex-transitive graph,Robertson–Seymour theorem,Forbidden graph characterization,Graph isomorphism,Cograph,Mathematics,Pancyclic graph,Triangle-free graph | Journal |
Volume | Issue | ISSN |
48 | 4 | 0364-9024 |
Citations | PageRank | References |
3 | 0.54 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vasyl Dmytrenko | 1 | 14 | 1.99 |
| Felix Lazebnik | 2 | 353 | 49.26 |
| Raymond Viglione | 3 | 28 | 2.61 |