What people are saying - Write a review
We haven't found any reviews in the usual places.
The ipectnim of the value k for which there exists complete iarc in PG2q or q 23
On Dtsunce Two Labelling of Graphs by Daphne D F Liu and Roger K Yth
The Discrete Logarithm Problem in GLn q by Alfred J Menezes and YiHong Wu
25 other sections not shown
adjacent adjugate algorithm array assume automorphism Baers binary bipartite graph blocks chordal graphs circuit clustering column complete fc-arcs complete graph components Computer configurations connected graph consecutive coloring construction contains contradiction Corollary cut vertex cycle defined degree disjoint DYRs E-cordial labelling edge-integrity elements equivalent exactly exists Figure finite follows graph G Graph Theory Hence implies independent set induced induced subgraph integer isomorphic large line latin rectangles Latin squares least common multiple Lemma Let G loopless Hamiltonian digraph matrix matroid maximal maximal independent set mutually pseudosimilar node non-binary non-isomorphic number of edges number of vertices obtained orthogonal p-competition graph pair partition path points polynomial positive integer problem Proof Proposition prove pseudosimilar vertices result satisfies self-dual codes sequence Steiner triple systems subgraph subset Suppose switching distance graph Theorem tournament tree vectors vertex set vertices of G weighing matrices weight Youden squares