A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a se
A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and
Games often provide a good introduction to interesting phenomena in mathematics. In this note, we examine three variations of an iterative sharing game played a
Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function ?is called a signed dominating function (SDF) if ?for each vertex . Th
The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devo