O. Suil

activity

20162020

most cited

K_{r + 1}

-saturated graphs with small spectral radius

2 citations · 2 across the 2 of their papers we have counts for

collaborators

5 papers

math.CO2020★ 2 cited

$K_{r + 1}$ -saturated graphs with small spectral radius

Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka +1

For a graph $H$ , a graph $G$ is $H$ -saturated if $G$ does not contain $H$ as a subgraph but for any $e \in E (G)$ , $G + e$ contains $H$ . In this note, we prove a sharp lowe…

math.CO2019

Sharp upper bounds on the $k$ -independence number in graphs with given minimum and maximum degree

Zhenyu Taoqiu, Suil O, Yongtang Shi

The $k$ -independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$ . In this paper, for each positive integer $k$ , we prove sh…

math.CO2018

Sharp conditions for the existence of an even $[a, b]$ -factor in a graph

Eun-Kyung Cho, Jong Yoon Hyun, Suil O +1

Let $a$ and $b$ be positive integers. An even $[a, b]$ -factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \in V (G)$ , $d_{H} (v)$ is even and $a \le d_H(v) \…

math.CO2017

Sharp bounds for the Randic index of graphs with given minimum and maximum degree

Suil O, Yongtang Shi

The Randi{\' c} index of a graph $G$ , written $R (G)$ , is the sum of $\frac{1}{d ( u ) d ( v )}$ over all edges $uv$ in $E (G)$ . %let $R(G)=\sum_{uv \in E(G)} \frac 1{\sqrt{d(u)d(v)}}…

math.CO2016

Spectral radius and fractional matchings in graphs

Suil O

A {\it fractional matching} of a graph $G$ is a function $f$ giving each edge a number in $[0, 1]$ so that $\sum_{e \in Γ (v)} f (e) \leq 1$ for each $v \in V (G)$ , where $Γ (v)$ is the s…

Kr+1​-saturated graphs with small spectral radius

Sharp upper bounds on the k-independence number in graphs with given minimum and maximum degree

Sharp conditions for the existence of an even [a,b]-factor in a graph

Sharp bounds for the Randic index of graphs with given minimum and maximum degree

Spectral radius and fractional matchings in graphs

$K_{r + 1}$ -saturated graphs with small spectral radius

Sharp upper bounds on the $k$ -independence number in graphs with given minimum and maximum degree

Sharp conditions for the existence of an even $[a, b]$ -factor in a graph