The following pages link to Suil O (Q244831):
Displaying 35 items.
- Spectral radius and fractional matchings in graphs (Q268270) (← links)
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- Cubic graphs with large ratio of independent domination number to domination number (Q295260) (← links)
- Average connectivity and average edge-connectivity in graphs (Q390306) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- Longest cycles in \(k\)-connected graphs with given independence number (Q651036) (← links)
- The difference and ratio of the fractional matching number and the matching number of graphs (Q906487) (← links)
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree (Q1671320) (← links)
- Forbidden pairs and the existence of a spanning Halin subgraph (Q1684949) (← links)
- Extremal problems on saturation for the family of $k$-edge-connected graphs (Q1741522) (← links)
- A Cvetković-type theorem for coloring of digraphs (Q2052174) (← links)
- Colorings in digraphs from the spectral radius (Q2080237) (← links)
- A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs (Q2099477) (← links)
- The second largest eigenvalue and vertex-connectivity of regular multigraphs (Q2181221) (← links)
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues (Q2185908) (← links)
- The minimum spectral radius of \(K_{r + 1}\)-saturated graphs (Q2198388) (← links)
- Spectral radius and matchings in graphs (Q2229492) (← links)
- Sharp lower bounds on the fractional matching number (Q2345617) (← links)
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (Q2352793) (← links)
- On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
- Hamiltonicity in connected regular graphs (Q2445323) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
- Eigenvalues and parity factors in graphs with given minimum degree (Q2685325) (← links)
- Laplacian eigenvalue distribution of a graph with given independence number (Q2698249) (← links)
- Sharp spectral bounds for the edge-connectivity of regular graphs (Q2701013) (← links)
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs (Q3013140) (← links)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order (Q4685895) (← links)
- Sharp conditions for the existence of an even $[a,b]$-factor in a graph (Q4991404) (← links)
- (Q5089326) (← links)
- Edge-connectivity in regular multigraphs from eigenvalues (Q5962474) (← links)
- Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
- On the spectral radius of graphs with given maximum degree and girth (Q6492426) (← links)
- The average connectivity matrix of a graph (Q6646412) (← links)
