Let G be a simple connected graph with vertex set V (G) and edge set E (G). The first Zagreb
index M 1 (G) and the second Zagreb index M 2 (G) are defined as follows: M 1 (G)=∑ v∈ V …

The chromatic edge stability number es _ χ (G) es χ (G) of a graph G is the minimum number
of edges whose removal results in a graph H ⊆ GH⊆ G with chromatic number χ (H)= χ (G) …

Let G be a graph. The chromatic edge-stability number es χ (G) of a graph G is the minimum
number of edges of G whose removal results in a graph H with χ (H)= χ (G)− 1. A Nordhaus …

The smallest number of vertices that have to be deleted from a graph G to obtain a bipartite
subgraph is called the bipartite vertex frustration of G and denoted by ψ (G). In this paper …

The direct product of graphs G=(V (G), E (G)) and H=(V (H), E (H)) is the graph, denoted as
G× H, with vertex set V (G× H)= V (G)× V (H), where vertices (x 1, y 1) and (x 2, y 2) are …

The bipartite edge frustration of a graph G, denoted by φ (G), is the smallest number of
edges that have to be deleted from G to obtain a bipartite spanning subgraph of G. This …

The smallest number of edges that have to be deleted from a graph to obtain a bipartite
spanning subgraph is called the bipartite edge frustration of G and denoted by φ (G). This …

The vertex and edge bipartization problems are to find the minimum number of vertices and
edges, respectively, whose removal makes the graph bipartite. It is well-known that these …

Let G=(V, E) be a simple graph. The bipartite vertex frustration of G, denoted by ψ (G), is the
smallest number of vertices that have to be deleted from a graph to obtain a bipartite …

A molecular graph is a graph such that its vertices correspond to the atoms and the edges to
the bonds of a given molecule. Fullerenes are molecules in the form of polyhedral closed …