2 papers
math.CO2022
Successive vertex orderings of fully regular graphs
Lixing Fang, Hao Huang, Janos Pach +2
A graph G = (V,E) is called fully regular if for every independent set , the number of vertices in I that are not connected to any element of I depends on…
math.CO2019
A graph inequality on the common neighbourhood
Xiaomin Chen, Fenglin Huang, Shuhan Zhou +2
In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality. The result was first d…