• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.109-123
• /
• 2003

A tree is called starlike if it has exactly one vertex of degree greate. than two. In [4] it was proved that two starlike trees G and H are cospectral if and only if they are isomorphic. We prove here that there exist no two non-isomorphic Laplacian cospectral starlike trees. Further, let G be a simple graph of order n with vertex set V(G) : {1,2, …, n} and let H = {$H_1$, $H_2$, …, $H_{n}$} be a family of rooted graphs. According to [2], the rooted product G(H) is the graph obtained by identifying the root of $H_{i}$ with the i-th vertex of G. In particular, if H is the family of the paths $P_k_1,P_k_2,...P_k_2$ with the rooted vertices of degree one, in this paper the corresponding graph G(H) is called the sunlike graph and is denoted by G($k_1,k_2,...k_n$). For any $(x_1,x_2,...,x_n)\;\in\;{I_*}^n$, where $I_{*}$ = : {0,1}, let G$(x_1,x_2,...,x_n)$ be the subgraph of G which is obtained by deleting the vertices $i_1,i_2,...i_j\;\in\;V(G)\;(O\leq j\leq n)$, provided that $x_i_1=x_i_2=...=x_i_j=o.\;Let \;G[x_1,x_2,...x_n]$ be characteristic polynomial of G$(x_1,x_2,...,x_n)$, understanding that G[0,0,...,0] $\equiv$1. We prove that $G[k_1,k_2,...,k_n]-\sum_{x\in In}[{\prod_{\imath=1}}^n\;P_k_i+x_i-2(\lambda)](-1)...G[x_1,x_2,...,X_n]$ where x=($x_1,x_2,...,x_n$);G[$k_1,k_2,...,k_n$] and $P_n(\lambda)$ denote the characteristic polynomial of G($k_1,k_2,...,k_n$) and $P_n$, respectively. Besides, if G is a graph with $\lambda_1(G)\;\geq1$ we show that $\lambda_1(G)\;\leq\;\lambda_1(G(k_1,k_2,...,k_n))<\lambda_1(G)_{\lambda_1}^{-1}(G}$ for all positive integers $k_1,k_2,...,k_n$, where $\lambda_1$ denotes the largest eigenvalue.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.1-14
• /
• 2024

Let G = (V, E) be a (p, q) graph. Define $$\begin{cases}\frac{p}{2},\:if\:p\:is\:even\\\frac{p-1}{2},\:if\:p\:is\:odd\end{cases}$$ and L = {±1, ±2, ±3, ···, ±ρ} called the set of labels. Consider a mapping f : V → L by assigning different labels in L to the different elements of V when p is even and different labels in L 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 difference cordial labeling if for each edge uv of G there exists a labeling |f(u) - f(v)| such that |Δ_f1 - Δ_f^c1| ≤ 1, where Δ_f1 and Δ_f^c1 respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of subdivision of some graphs.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.651-659
• /
• 2013

A graph is $s$-regular if its automorphism group acts regularly on the set of its $s$-arcs. In this paper, the cubic $s$-regular graphs of order 12p, 36p, 44p, 52p, 66p, 68p and 76p are classified for each $s{\geq}1$ and each prime $p$. The number of cubic $s$-regular graphs of order 12p, 36p, 44p, 52p, 66p, 68p and 76p is 4, 3, 7, 8, 1, 4 and 1, respectively. As a partial result, we determine all cubic $s$-regular graphs of order 70p except for $p$ = 31, 41.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1774-1779
• /
• 2005

This paper propose the design method of the constructing the digital logic systems over galois fields using by the galois field decision diagram(GFDD) that is based on the graph theory. The proposed design method is as following. First of all, we discuss the mathematical properties of the galois fields and the basic properties of the graph theory. After we discuss the operational domain and the functional domain, we obtain the transformation matrixes, $\psi$GF(P)(1) and $\xi$GF(P)(1), in the case of one variable, that easily manipulate the relationship between two domains. And we extend above transformation matrixes to n-variable case, we obtain $\psi$GF(P)(1) and $\xi$GF(P)(1). We discuss the Reed-Muller expansion in order to obtain the digital switching functions of the P-valued single variable. And for the purpose of the extend above Reed-Muller expansion to more two variables, we describe the Kronecker product arithmetic operation.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.525-534
• /
• 2019

Let $P(G,{\lambda})$ denote the number of proper vertex colorings of G with ${\lambda}$ colors. The chromatic polynomial $P(C_n,{\lambda})$ for the cycle graph $C_n$ is well-known as $$P(C_n,{\lambda})=({\lambda}-1)^n+(-1)^n({\lambda}-1)$$ for all positive integers $n{\geq}1$. Also its inductive proof is widely well-known by the deletion-contraction recurrence. In this paper, we give this inductive proof again and three other proofs of this formula of the chromatic polynomial for the cycle graph $C_n$.

• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.565-586
• /
• 2017

In this paper we continue to investigate the Super Vertex Mean behaviour of all graphs up to order 5 and all regular graphs up to order 7. Let G(V,E) be a graph with p vertices and q edges. Let f be an injection from E to the set {1,2,3,${\cdots}$,p+q} that induces for each vertex v the label defined by the rule $f^v(v)=Round\;\left({\frac{{\Sigma}_{e{\in}E_v}\;f(e)}{d(v)}}\right)$, where $E_v$ denotes the set of edges in G that are incident at the vertex v, such that the set of all edge labels and the induced vertex labels is {1,2,3,${\cdots}$,p+q}. Such an injective function f is called a super vertex mean labeling of a graph G and G is called a Super Vertex Mean Graph.

• Journal of the Korean Mathematical Society
• /
• v.47 no.5
• /
• pp.967-983
• /
• 2010

Let M be an n-dimensional complete simply connected Riemannian manifold with sectional curvature bounded above by a nonpositive constant $-{\kappa}^2$. Using the cone total curvature TC($\Gamma$) of a graph $\Gamma$ which was introduced by Gulliver and Yamada [8], we prove that the density at any point of a soap film-like surface $\Sigma$ spanning a graph $\Gamma\;\subset\;M$ is less than or equal to $\frac{1}{2\pi}\{TC(\Gamma)-{\kappa}^2Area(p{\times}\Gamma)\}$. From this density estimate we obtain the regularity theorems for soap film-like surfaces spanning graphs with small total curvature. In particular, when n = 3, this density estimate implies that if $TC(\Gamma)$ < $3.649{\pi}\;+\;{\kappa}^2\inf\limits_{p{\in}F}Area(p{\times}{\Gamma})$, then the only possible singularities of a piecewise smooth (M, 0, $\delta$)-minimizing set $\Sigma$ are the Y-singularity cone. In a manifold with sectional curvature bounded above by $b^2$ and diameter bounded by $\pi$/b, we obtain similar results for any soap film-like surfaces spanning a graph with the corresponding bound on cone total curvature.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.95-101
• /
• 2014

An n-tuple ($a_1,a_2,{\ldots},a_n$) is symmetric, if $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$. Let $H_n$ = {$(a_1,a_2,{\ldots},a_n)$ ; $a_k$ ${\in}$ {+,-}, $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair $S_n$ = (G,${\sigma}$) ($S_n$ = (G,${\mu}$)), where G = (V,E) is a graph called the underlying graph of $S_n$ and ${\sigma}$:E ${\rightarrow}H_n({\mu}:V{\rightarrow}H_n)$ is a function. The restricted super line graph of index r of a graph G, denoted by $\mathcal{R}\mathcal{L}_r$(G). The vertices of $\mathcal{R}\mathcal{L}_r$(G) are the r-subsets of E(G) and two vertices P = ${p_1,p_2,{\ldots},p_r}$ and Q = ${q_1,q_2,{\ldots},q_r}$ are adjacent if there exists exactly one pair of edges, say $p_i$ and $q_j$, where $1{\leq}i$, $j{\leq}r$, that are adjacent edges in G. Analogously, one can define the restricted super line symmetric n-sigraph of index r of a symmetric n-sigraph $S_n$ = (G,${\sigma}$) as a symmetric n-sigraph $\mathcal{R}\mathcal{L}_r$($S_n$) = ($\mathcal{R}\mathcal{L}_r(G)$, ${\sigma}$'), where $\mathcal{R}\mathcal{L}_r(G)$ is the underlying graph of $\mathcal{R}\mathcal{L}_r(S_n)$, where for any edge PQ in $\mathcal{R}\mathcal{L}_r(S_n)$, ${\sigma}^{\prime}(PQ)$=${\sigma}(P){\sigma}(Q)$. It is shown that for any symmetric n-sigraph $S_n$, its $\mathcal{R}\mathcal{L}_r(S_n)$ is i-balanced and we offer a structural characterization of super line symmetric n-sigraphs of index r. Further, we characterize symmetric n-sigraphs $S_n$ for which $\mathcal{R}\mathcal{L}_r(S_n)$~$\mathcal{L}_r(S_n)$ and $$\mathcal{R}\mathcal{L}_r(S_n){\sim_=}\mathcal{L}_r(S_n)$$, where ~ and $$\sim_=$$ denotes switching equivalence and isomorphism and $\mathcal{R}\mathcal{L}_r(S_n)$ and $\mathcal{L}_r(S_n)$ are denotes the restricted super line symmetric n-sigraph of index r and super line symmetric n-sigraph of index r of $S_n$ respectively.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.1141-1146
• /
• 2009

The compressibility of clay has been expressed e-log p' graph. In natural clay, e-log p' graph are changed by deposition condition and chemical cementation as well as Atterberg limits, whereas in reconstituted clay, it is generally known that e-log p’ curve is varied with Atterberg limits. However, e-log p' graph is possible to change according to the reconstituting methods and test conditions. In this study, consolidation tests are performed as various test condition for reconstituted Busan clay. Test results show that the relationship e/$e_L$ and log p' is almost constant with $e_L$. And the compression index obtained from slurry method sample is larger than one obtained from kneading method sample. Intrinsic compression line (ICL) of Busan clay is identical with ICL suggested by Burland.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.507-519
• /
• 2017

We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work. Our new bound in the current paper is much better than the previous bound, and it is a general bound with no restriction. We point out that our bound is explicitly computable by using the valencies and the intersection matrix of a distance-regular graph. As a major tool, we use the discrete Green's function, which is defined as the inverse of ${\beta}$-Laplacian for some positive real number ${\beta}$. We present some examples of distance-regular graphs, where we compute our upper bound on their Cheeger constants.