
In this paper, we show the necessary and sufficient conditions for a complete graph on
Given a digraph (an undirected graph, resp.)
Let
Frucht and Salinas [1] conjectured that
For smaller cases we prove that
We present necessary and sufficient conditions for the decomposition of the complete symmetric bipartite digraph into each of the orientations of a
The sum graph of a set
Let
An alternating circular list of distinct
The general Randić index
The Hermitean forms graphs Her
A cyclic triple,
Let
Two combinatorial identities are proved:
(1)
(2)
Simple closed formulae for
We derive the exact joint distribution and prove the asymptotic joint normality of the numbers of peaks, double rises, troughs, and double falls in a random permutation. A Chi-square randomness test, as a by-product, is also proposed.
For a graph
That is,
We establish sharp upper and lower bounds on
In this paper, generalizations of edge-cordial labelings are introduced and studied for special classes of trees and graphs.
The total of
In particular,
An extensive search with
We give new sets of sequences with zero autocorrelation function and entries from the set
We show the known necessary conditions for the existence of an OD
We establish asymptotic existence results for OD
Let
Let
We completely settle the existence problem for group divisible designs with first and second associates in which the block size is
We give a new and simple proof for the cyclic group of line crossings on the
An abdiff-tolerance competition graph,
Special issue: Proceedings of International Conference on Discrete Mathematics (ICDM 2025)
1970-2025 CP (Manitoba, Canada) unless otherwise stated.