On construction and identification of graphs

@inproceedings{Weisfeiler1976OnCA,
  title={On construction and identification of graphs},
  author={B. Weisfeiler},
  year={1976}
}
Some remarks about the problem of graph identification.- Motivation.- A construction of a stationary graph.- Properties of cells.- Properties of cellular algebras of rank greater than one.- Cellular algebras arising in the theory of permutation groups.- Some classes of cellular algebras.- Imprimitive cells and construction of factor-cells.- Construction of the quotient in the case of cellular algebras of rank greater than one.- On the structure of correct stationary graphs and cells having more… Expand
Graph isomorphism problem
The article is a creative compilation of certain papers devoted to the graph isomorphism problem, which have appeared in recent years. An approach to the isomorphism problem is proposed in the firstExpand
Stabilization procedures and applications
TLDR
This thesis introduces an efficient way of computing 1- and 2-stable partitions and presents a particular version of a k-dimensional stabilization algorithm used in chemistry. Expand
On the automorphism groups of strongly regular graphs I
  • L. Babai
  • Mathematics, Computer Science
  • ITCS
  • 2014
TLDR
It is proved that no polynomial-time categorical reduction of GI to isomorphism of s.r. graphs is possible, giving a surprisingly strong answer to a decades-old problem, and state a purely mathematical conjecture that could bring us closer to finding the right kind of hierarchy. Expand
Directed strongly regular graphs obtained from coherent algebras
Abstract The notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of the possible generalizations of classical strongly regular graphs to the directed case. WeExpand
Fundamentals of structural treatment of the graphs
Structure S is the attribute of organization (ordering) of the discrete system, i.e. of a formation that consists of the elements (objects) and the binary relations between these. Structure as suchExpand
On the Weisfeiler-Leman Dimension of Finite Groups
TLDR
The results indicate that the Weisfeiler-Leman algorithm can be more effective in distinguishing groups than in distinguishing graphs based on similar combinatorial constructions. Expand
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
  • Michael Huber
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2011
TLDR
This paper studies the computational complexity of isomorphism testing for line graphs of t-(v,k,@l) designs and shows that t-designs can be reconstructed from their line graphs in polynomial-time. Expand
Graph Isomorphism Restricted by Lists
TLDR
It is proved that when GraphIso is GI-complete for a class of graphs, it translates into NP-completeness of ListIso, and that no robust algorithm for cubic graph isomorphism exists, unless P = NP. Expand
The structure of graphs and new logics for the characterization of Polynomial Time
TLDR
This thesis considers an incongruence between machine computations and logics, and the open question whether there exists a logic which generally captures polynomial-time computations, and introduces a variety of rank logics with the ability to compute the ranks of matrices over (finite) prime fields. Expand
The Graph Isomorphism Problem and approximate categories
  • H. Derksen
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 2013
TLDR
An algorithm can distinguish the Cai-Furer-Immerman graphs in polynomial time and it is shown that the WL-algorithms reduce to the algorithms, but that the algorithms cannot be reduced to the W lgorithms. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
A SURVEY OF TWO-GRAPHS
This chapter reviews two graphs, phrased switching classes of graphs, sets of equidistant points in elliptic geometry, sets of equiangular lines in Euclidean geometry, binary maps of triples withExpand
On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
  • A. Hoffman
  • Mathematics, Computer Science
  • IBM J. Res. Dev.
  • 1960
TLDR
The present paper describes a method for enumerating all counter-examples when n = 8 and states that a certain simple set of properties characterize the relationship of adjacency of the n(n - 1)/2 arcs of the complete graph of order n. Expand
On the orbits of collineation groups
In this paper we consider some results on the orbits of groups of collineations, or, more generally, on the point and block classes of tactical decompositions, on symmetric balanced incomplete blockExpand
On a combinatorial generalization of 27 lines associated with a cubic surface
Given integers 0 G with the following properties: G is of order ν (i.e. has ν vertices), is regular of degree κ (i.e. every vertex is adjacent to exactly κ other vertices), and every pair of verticesExpand
A simple group of order 44,352,000
The group G of the title is obtained as a primitive permutation group of degree 100 in which the stabilizer of a point has orbits of lengths 1, 22 and 77 and is isomorphic to the Mathieu group M22.Expand
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
TLDR
GIT—Graph Isomorphism Tester—incorporates a variety of processes that attempt to narrow down the search for an isomorphism, or to demonstrate that none exists. Expand
Intersection matrices for finite permutation groups
In this paper we study finite transitive groups G acting on a set Q. The results, which are trivial for multiply-transitive groups, directly generalize parts of the discussion of rank-3 groups in [4]Expand
(v, k, λ)-Graphs and polarities of (v, k, λ)-designs
In 2.1 it is established that there is a one-to-one correspondence between (v, k, λ)-graphs and polarities, with no absolute points, of (v, k, λ)-designs. This is used to show that the parameters ofExpand
On the Line Graph of the Complete Bipartite Graph
In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these propertiesExpand
Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
The ordinary graphs of finite order ν with (−1, 1, 0) adjacency matrix A satisfying ( A − ρ 1 I ) ( A − ρ 2 I ) = (ν − 1 + ρ 1 ρ 2 ) J , ρ 1 ρ 2 , AJ= ρ 0 J . The only eigenvalues are ρ 1 , ρ 2 , ρ 0Expand
...
1
2
3
4
5
...