research
∙
08/03/2023
Inequalities Connecting the Annihilation and Independence Numbers
Given a graph G, the number of its vertices is represented by n(G), whil...
share
research
∙
06/29/2023
Recognizing 𝐖_2 Graphs
Let G be a graph. A set S ⊆ V(G) is independent if its elements are pair...
research
∙
05/02/2023
The independence polynomial of trees is not always log-concave starting from order 26
An independent set in a graph is a collection of vertices that are not a...
research
∙
09/01/2022
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs
The independence number α(G) is the cardinality of a maximum independent...
research
∙
05/28/2022
Fair Division Algorithms for Electricity Distribution
In many developing countries, the total electricity demand is larger tha...
research
∙
01/02/2022
A Linear Algorithm for Computing Independence Polynomials of Trees
An independent set in a graph is a set of pairwise non-adjacent vertices...
research
∙
07/18/2021
Cospanning characterizations of antimatroids and convex geometries
Given a finite set E and an operator σ:2^E⟶2^E, two sets X,Y⊆ E are cosp...
research
∙
05/11/2021
Cospanning characterizations of violator and co-violator spaces
Given a finite set E and an operator sigma:2^E–>2^E, two subsets X,Y of ...
research
∙
08/11/2020
Critical sets, crowns, and local maximum independent sets
A set S⊆ V(G) is independent (or stable) if no two vertices from S are a...
research
∙
05/22/2019
On the Critical Difference of Almost Bipartite Graphs
A set S⊆ V is independent in a graph G=( V,E) if no two vertices from S...
research
∙
11/12/2018
On an Annihilation Number Conjecture
Let α(G) denote the cardinality of a maximum independent set, while μ(G)...
research
∙
11/11/2018
Recognizing generating subgraphs revisited
A graph G is well-covered if all its maximal independent sets are of the...
research
∙
11/11/2018
Generating subgraphs in chordal graphs
A graph G is well-covered if all its maximal independent sets are of the...
research
∙
07/18/2018