
Fishburn, Tanenbaum, and Trenk define the linear discrepancy
To date, investigations on critical sets for a set of mutually orthogonal Latin squares (MOLS) have been carried out only for small orders
We improve the lower bound for the
A graph
where
A graph
Sum graph labeling offers a new method for defining graphs and for storing them digitally. Traditionally, a graph is defined as a set of vertices and a set of edges, specified by pairs of vertices which are the endpoints of an edge. To record a graph on a computer, the edges are usually stored either in the form of an adjacency matrix or as a linked list. Using sum graph labeling, we only need to store the set of vertices, together with some additional isolates, if needed. While previously the edges in a graph were specified explicitly, using sum graphs, edges can be specified implicitly.
A sum labeling
In this paper, we introduce exclusive sum graph labeling and we construct optimal exclusive sum graph labeling for complete bipartite graphs, paths, and cycles. The paper concludes with a summary of known results in exclusive sum labeling and exclusive sum numbers for several classes of graphs.
A total vertex irregular labeling of a graph
For given graphs
This paper investigates the Ramsey number
The notions of sum labeling and sum graph were introduced by Harary in 1990. In a sum labeling, a vertex is called a working vertex if its label is equal to the sum of the labels of a pair of two distinct vertices.
A sum labeling of a graph
In this paper, we show that some families of trees are
For graphs
Let
In this paper, we study the properties of super edge-magic total graphs. In particular, we propose some algorithms to construct new super edge-magic total graphs from the old ones. We also construct a super edge-magic total labeling on certain disconnected graphs, namely
Let
for some positive integers
This labeling is called \text{super
A total labeling of a graph
A simple graph
is constant. When
We study
Let
A
In this paper, the super edge-magic deficiency of certain forests and 2-regular graphs is computed, which in turn leads to some conjectures on the super edge-magic deficiencies of graphs in these classes. Additionally, some edge-magic deficiency analogues to the super edge-magic deficiency results on forests are presented.
Suppose
for some integers
In this paper, we deal with
A
A Vertex Magic Total Labeling of a graph
for some constant
1970-2025 CP (Manitoba, Canada) unless otherwise stated.