A stable (or independent) set in a graph is a set of pairwise non-adjacent vertices. The
stability number α (G) is the size of a maximum stable set in the graph G. There are three …

Let G be a simple graph of order n and size m. An edge covering of a graph is a set of edges
such that every vertex of the graph is incident to at least one edge of the set. In this paper we …

K. Dohmen, A. Pönitz and P. Tittmann [K. Dohmen, A. Pönitz, P. Tittmann, A new two-
variable generalization of the chromatic polynomial, Discrete Mathematics and Theoretical …

Zero forcing is an iterative graph coloring process, where given a set of initially colored
vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become …

∑ ∑ Page 1 Advances and Applications in Discrete Mathematics © 2022 Pushpa Publishing
House, Prayagraj, India http://www.pphmj.com http://dx.doi.org/10.17654/0974165822053 …

A subgraph H of a graph G is said to be convex if for every pair of vertices in H, any uv
geodesic in G lies entirely in H. We define the convex subgraph polynomial of G as the …

Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial,
the matching polynomial, and many others are widely studied. In this paper we examine to …

We look for graph polynomials which satisfy recurrence relations on three kinds of edge
elimination: edge deletion, edge contraction and edge extraction, ie, deletion of edges …

Convex Subgraph Polynomials of the Join and the Composition of Graphs Page 1 International
Journal of Mathematical Analysis Vol. 10, 2016, no. 11, 515 - 529 HIKARI Ltd, www.m-hikari.com …

This paper introduces the notion of balanced biclique polynomial of graphs. We
characterized the balanced biclique subgraphs of some special graphs. In addition, we …