• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.109-116
• /
• 2010

In this paper, we study the signless Laplacian spectral radius of bicyclic graphs with given number of pendant vertices and characterize the extremal graphs.

• Communications of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.389-400
• /
• 2021

For a graph G, the variable sum exdeg index SEI_a(G) is defined as Σ_u∈V(G)d_G(u)a^d_G(u), where a ∈ (0, 1) ∪ (1, +∞). In this work, we determine the minimum and maximum variable sum exdeg indices (for a > 1) of n-vertex cactus graphs with k cycles or p pendant vertices. Furthermore, the corresponding extremal cactus graphs are characterized.

• The Pure and Applied Mathematics
• /
• v.27 no.4
• /
• pp.171-186
• /
• 2020

Long back in 1972, it was shown that the sum of the squares of vertex degrees and the sum of cubes of vertex degrees of a molecular graph both have large correlations with total 𝜋-electron energy of the molecule. Later on, the sum of squares of vertex degrees was named as first Zagreb index and became one of the most studied molecular graph parameter in the field of chemical graph theory. Whereas, the other sum remained almost unnoticed until recently except for a few occasions. Thus it got the name "forgotten" index or F-index. This paper investigates extremal graphs with respect to F-index among the class of bicyclic graphs with n vertices and k pendant vertices, 0 ≤ k ≤ n - 4. As consequences, we obtain the bicyclic graphs with largest and smallest F-indices.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.9-17
• /
• 2016

In this paper, it has been shown that the hairy cycle C_n ⊙ rK₁, n ≡ 3(mod4), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle C_n ⊙ 1K₁, n ≡ 0(mod4), double graph of path P_n and double graph of comb P_n ⊙ 1K₁ are k-graceful.

• Kyungpook Mathematical Journal
• /
• v.60 no.3
• /
• pp.467-475
• /
• 2020

Let G be a chemical graph with vertex set {v₁, v₁, …, v_n} and degree sequence d(G) = (deg_G(v₁), deg_G(v₂), …, deg_G(v_n)). The inverse degree, R(G) of G is defined as $R(G)={\sum{_{i=1}^{n}}}\;{\frac{1}{deg_G(v_i)}}$. The cyclomatic number of G is defined as γ = m - n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.

• Journal of the Korean Mathematical Society
• /
• v.42 no.6
• /
• pp.1251-1264
• /
• 2005

Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. The competition number of a graph G, denoted by k(G), is the smallest number k such that G together with k isolated vertices is the competition graph of an acyclic digraph. It is known to be difficult to compute the competition number of a graph in general. Even characterizing the graphs with competition number one looks hard. In this paper, we continue the work done by Cho and Kim[3] to characterize the graphs with one hole and competition number one. We give a sufficient condition for a graph with one hole to have competition number one. This generates a huge class of graphs with one hole and competition number one. Then we completely characterize the graphs with one hole and competition number one that do not have a vertex adjacent to all the vertices of the hole. Also we show that deleting pendant vertices from a connected graph does not change the competition number of the original graph as long as the resulting graph is not trivial, and this allows us to construct infinitely many graph having the same competition number. Finally we pose an interesting open problem.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.255-266
• /
• 2014

For a connected graph G = (V,E) of order at least two, a set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x - y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G, denoted by m(G). Certain general properties satisfied by the monophonic sets are studied. Graphs G of order p with m(G) = 2 or p or p - 1 are characterized. For every pair a, b of positive integers with $2{\leq}a{\leq}b$, there is a connected graph G with m(G) = a and g(G) = b, where g(G) is the geodetic number of G. Also we study how the monophonic number of a graph is affected when pendant edges are added to the graph.