Suil O

According to our database1, Suil O authored at least 20 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
An odd [1, b]-factor in regular graphs from eigenvalues.
Discret. Math., 2020

The minimum spectral radius of Kr+1-saturated graphs.
Discret. Math., 2020

The second largest eigenvalue and vertex-connectivity of regular multigraphs.
Discret. Appl. Math., 2020

2019
Extremal problems on saturation for the family of k-edge-connected graphs.
Discret. Appl. Math., 2019

2018
Sharp bounds for the Randić index of graphs with given minimum and maximum degree.
Discret. Appl. Math., 2018

2017
Forbidden Pairs and the Existence of a Spanning Halin Subgraph.
Graphs Comb., 2017

On the Wiener index, distance cospectrality and transmission-regular graphs.
Discret. Appl. Math., 2017

2016
Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number.
Graphs Comb., 2016

Spectral radius and fractional matchings in graphs.
Eur. J. Comb., 2016

The difference and ratio of the fractional matching number and the matching number of graphs.
Discret. Math., 2016

On r-dynamic coloring of graphs.
Discret. Appl. Math., 2016

2015
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs.
Discret. Appl. Math., 2015

Sharp lower bounds on the fractional matching number.
Discret. Appl. Math., 2015

2013
Hamiltonicity in connected regular graphs.
Inf. Process. Lett., 2013

Average connectivity and average edge-connectivity in graphs.
Discret. Math., 2013

Game matching number of graphs.
Discret. Appl. Math., 2013

2011
Longest cycles in k-connected graphs with given independence number.
J. Comb. Theory, Ser. B, 2011

Matching and edge-connectivity in regular graphs.
Eur. J. Comb., 2011

2010
Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs.
SIAM J. Discret. Math., 2010

Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree.
J. Graph Theory, 2010


  Loading...