Transactions of the American Mathematical Society, Vol. 332, No. 2 (Aug., 1992), pp. 729-756 (28 pages) In this paper we present several results and open problems about log-concavity properties of ...

Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

Introduction, Statements, and Notation, Connectives, Well-formed formulas, Tautology, Duality law, Equivalence, Implication, Normal Forms, Functionally complete set ...

In graph theory, the chromatic polynomial of a graph is a polynomial that counts the number of proper vertex colorings of the graph using a given number of colors. Formally, let G be a graph with n ...

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...

ABSTRACT: In this paper, we discuss about the b-colouring and b-chromatic number for middle graph of Cycle, Path, Fan graph and Wheel graph denoted as M[Cn],M[Pn],M[F1,n] and M[Wn] .

ABSTRACT: Let G be a simple graph with vertex set V(G) and edge set E(G). An edge coloring C of G is called an edge cover coloring, if each color appears at least once at each vertex . The maximum ...