3 citations · 6 across the 5 of their papers we have counts for
5 papers
Arc reversals of cycles in orientations of vertex-multiplications
W. H. W. Wong, E. G. Tay
Ryser proved that any two tournaments with the same score sequence are -equivalent while Beineke and Moon proved the -equivalence for any two bipartite tournaments with t…
Optimal orientations of vertex-multiplications of cartesian products of graphs
W. H. W. Wong, E. G. Tay
Koh and Tay proved a fundamental classification of vertex-multiplications into three classes and . In this paper, we prove that ve…
A complete characterisation of vertex-multiplications of trees with diameter 5
W. H. W. Wong, E. G. Tay
Koh and Tay introduced a new family of graphs, vertex-multiplications, as an extension of complete -partite graphs. They proved a fundamental classification of vertex-mu…
On optimal orientations of complete tripartite graphs
W. H. W. Wong, E. G. Tay
Given a connected and bridgeless graph , let be the family of strong orientations of . The orientation number of is defined to be $\bar{d}(G):=min\{d(D)|…
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
Fengming Dong, Jun Ge, Helin Gong +3
The chromatic polynomial of a graph of order can be expressed as , where is interpreted as the number of broken-cycle…