Intersection number (graph theory)
Semantic Scholar uses AI to extract papers important to this topic.
- The American Mathematical Monthly
Let H,K be subgroups of G. We investigate the intersection properties of left and right cosets of these subgroups. If H and K are… (More)
- SIAM J. Scientific Computing
A typical first step of a direct solver for the linear system Mx = b is reordering of the symmetric matrix M to improve execution… (More)
In recent years, the theory of group representations has greatly benefited from a new approach provided by the topology of… (More)
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the… (More)
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an “L” shaped… (More)
Let ⊢ be a rank-2 intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the… (More)
- SIAM J. Discrete Math.
K. F. Fraughnaugh et al. proved that a graph G is the competition graph of a hamiltonian digraph possibly having loops if and… (More)
Assume that G = G(V, E) is an undirected graph with vertex set V and edge set E. A clique of G is a complete subgraph. An edge… (More)
- J. Comb. Theory, Ser. A
In this paper we examine 2-designs having an intersection number k n. This intersection number gives rise to an equivalence… (More)
Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain… (More)