• Journal of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.959-986
• /
• 2023

Zhai and Lin recently proved that if G is an n-vertex connected 𝜃(1, 2, r + 1)-free graph, then for odd r and n ⩾ 10r, or for even r and n ⩾ 7r, one has ${\rho}(G){\leq}{\sqrt{{\lfloor}{\frac{n^2}{4}}{\rfloor}}}$, and equality holds if and only if G is $K_{{\lceil}{\frac{n}{2}}{\rceil},{\lfloor}{\frac{n}{2}}{\rfloor}}$. In this paper, for large enough n, we prove a sharp upper bound for the spectral radius in an n-vertex H-free non-bipartite graph, where H is 𝜃(1, 2, 3) or 𝜃(1, 2, 4), and we characterize all the extremal graphs. Furthermore, for n ⩾ 137, we determine the maximum number of edges in an n-vertex 𝜃(1, 2, 4)-free non-bipartite graph and characterize the unique extremal graph.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.23-30
• /
• 2014

For two positive integers r and s, $\mathcal{G}$(n; r; ${\theta}_s$) denotes to the class of graphs on n vertices containing no r of edge disjoint ${\theta}_s$-graphs and f(n; r; ${\theta}_s$) = max{${\varepsilon}(G)$ : G ${\in}$ $\mathcal{G}$(n; r; ${\theta}_s$)}. In this paper, for integers r, $k{\geq}2$, we determine f(n; r; ${\theta}_{2k+1}$) and characterize the edge maximal members in G(n; r; ${\theta}_{2k+1}$).

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.643-651
• /
• 2005

In the first part of this paper we investigate several statements concerning infinite maximal planar graphs which are equivalent in finite case. In the second one, for a given induced $\theta$-path (a finite induced path whose endvertices are adjacent to a vertex of infinite degree) in a 4-connected VAP-free maximal planar graph containing a vertex of infinite degree, a new $\theta$-path is constructed such that the resulting fan is tight.