• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.741-746
• /
• 2018

We study the Ihara zeta function of the dumbbell graph $D_{1,1,n}$ of type (1, 1, n) and $D_{1,2,n}$ of type (1, 2, n). Explicit formulas of the zeta functions of the graphs, their radius of convergence, and the connection with the number of closed cycles are given.

• Korean Journal of Mathematics
• /
• v.28 no.1
• /
• pp.123-136
• /
• 2020

In this paper, we give an explicit formula as a rational function for the Ihara zeta function of every finite connected graph without degree one vertices whose circuit rank is two.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.237-253
• /
• 2023

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} & \;\;p\text{ is even} \\ {\frac{p-1}{2}} & \;\;p\text{ is odd,}$$ and M = {±1, ±2, … ± ρ} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling ${\frac{{\lambda}(u)+{\lambda}(v)}{2}}$ if λ(u) + λ(v) is even and ${\frac{{\lambda}(u)+{\lambda}(v)+1}{2}}$ if λ(u) + λ(v) is odd such that ${\mid}{\bar{{\mathbb{S}}}}_{\lambda}{_1}-{\bar{{\mathbb{S}}}}_{{\lambda}^c_1}{\mid}{\leq}1$ where ${\bar{{\mathbb{S}}}}_{\lambda}{_1}$ and ${\bar{{\mathbb{S}}}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of few graphs including the closed helm graph, web graph, jewel graph, sunflower graph, flower graph, tadpole graph, dumbbell graph, umbrella graph, butterfly graph, jelly fish, triangular book graph, quadrilateral book graph.