11 pages matching circuit cover in this book
Results 1-3 of 11
What people are saying - Write a review
We haven't found any reviews in the usual places.
The Greatest Common Divisor Index of a Graph by Gary Chartrand Farrokh Saba
Further Results On The Multiplier Conjecture For The Case n 2n
19 other sections not shown
2-connected 6-cycles adjacent algebraic normal form algorithm all-even parity set assume BD(l bipartite graph blocks bridge-less graph Cayley graphs circuit cover circuit unique coil complete bipartite graph Computer Conjecture connected graph construct contains contradiction Corollary cycle of length define degree A(G degree sequence denote digraph disjoint divisor of Gj dominating set element exactly exists Figure Gj and G2 graph G graph on 2n Graph Theory graphs of diameter greatest common divisor hamiltonian Hence hypercubes id(m independent dominating independent m-dominating set intersection isomorphic JCMCC 20 kernel Lemma Let G link edges Mathematics maximal linear subcode nodes non-empty all-even parity obtained ordered-OGDD orthogonal pair path PDS's Petersen graph positive integer prove result satisfy set of vertices Steiner triple systems strict avalanche criterion subgroup Suppose TD(k tree triangle-free graphs triple systems vector vertex vertex-transitive vertices of degree vertices of G