A note on commuting graphs for symmetric groups.
A Note on Component-Wise Kronecker Designs.
A Note on Connectedness of Block Designs.
A note on consecutive ones in a binary matrix.
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments.
A Note On Constructions Of Graphs By Means Of Their Spectra
A note on cycle double covers in Cayley graphs.
A note on cyclic chromatic number
A cyclic colouring of a graph G embedded in a surface is a vertex colouring of G in which any two distinct vertices sharing a face receive distinct colours. The cyclic chromatic number of G is the smallest number of colours in a cyclic colouring of G. Plummer and Toft in 1987 conjectured that for any 3-connected plane graph G with maximum face degree Δ*. It is known that the conjecture holds true for Δ* ≤ 4 and Δ* ≥ 18. The validity of the conjecture is proved in the paper for some special classes...
A note on degree-continuous graphs
The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.
A note on dimension of
A note on divisibility of the number of matchings of a family of graphs.
A note on domatically critical and cocritical graphs
A note on domination in bipartite graphs
DOMINATING SET remains NP-complete even when instances are restricted to bipartite graphs, however, in this case VERTEX COVER is solvable in polynomial time. Consequences to VECTOR DOMINATING SET as a generalization of both are discussed.
A note on domination parameters in random graphs
Domination parameters in random graphs G(n,p), where p is a fixed real number in (0,1), are investigated. We show that with probability tending to 1 as n → ∞, the total and independent domination numbers concentrate on the domination number of G(n,p).
A note on domination parameters of the conjunction of two special graphs
A dominating set D of G is called a split dominating set of G if the subgraph induced by the subset V(G)-D is disconnected. The cardinality of a minimum split dominating set is called the minimum split domination number of G. Such subset and such number was introduced in [4]. In [2], [3] the authors estimated the domination number of products of graphs. More precisely, they were study products of paths. Inspired by those results we give another estimation of the domination number of the conjunction...
A note on domino shuffling.
A note on domino treewidth.
A note on edge-colourings avoiding rainbow and monochromatic .
A note on embedding and generating dual polar spaces.
A note on embedding hypertrees.