Congressus Numerantium, المجلد 181

1-resilient function adjacent auxiliary vertices B₁ bent function binomial transform Boolean functions bottleneck flow control chessboard chromatic index codec color class color sequence coloring of G construct contains contradiction converge cube cubic graphs cycle cyclic decomposition denote disjoint dominating set dominator chromatic number dominator coloring edge in H edge-graceful labeling exists Figure flow control algorithm free steering G and H GATE1 graph G Graph Theory greedy algorithm induced subdigraph influence digraph integer intersection graph irregular chromatic number irregular coloring isomorphic knight's tour label Lemma Nash equilibrium node non-decreasing path NP-complete number of vertices P₁ path in H PBIBD problem Proof Proposition result safe clique partition shared star graph substar super edge-graceful Suppose Theorem time-stamped graph timestamp tree of order triad u₁ updating v₁ vertex set vertices of degree X₁ X₁+1 Xa(G Xi+1 Xir Cn Xir G Xj+1 Y₁ Z₁