The b-chromatic number of a graph, written as φ(G), is the highest number of colors you can use to color the graph properly, with one special rule: in each color group, there must be at least one ...

Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

In this paper, we extend the sampling theory on graphs by constructing a framework that exploits the structure in product graphs for efficient sampling and recovery of bandlimited graph signals that ...

Abstract. Let 𝐼(𝐺;𝑥) denote the independence polynomial of a graph 𝐺. In this paper we study the unimodality properties of 𝐼(𝐺;𝑥) for some composite graphs 𝐺. Given two graphs 𝐺₁ and 𝐺₂, let ...