Generalized the Liouville’s and Möbius functions of graph

Let G = (V, E) be a simple connected undirected graph. In this paper, we define generalized the Liouville’s and Möbius functions of a graph G which are the sum of Liouville λ and Möbius μ functions of the degree of the vertices of a graph denoted by Λ(G) = ∑ v∈V(G) λ(deg(v)) and M(G) = ∑ v∈V(G) μ(deg(v)), respectively. We also determine the Liouville’s and Möbius functions of some standard graphs as well as determining the relationships between the two functions with their proofs. The sum of generalized the Liouville and Möbius functions extending over the divisor d of degree of vertices of graphs is also given.


Introduction
T he Liouville and Möbius functions arise and play an important role in various places in number theory which are denoted by λ and µ, respectively. The Liouville λ-function is defined as: (−1) a 1 +...+a k if n = p 1 a 1 p 2 a 2 . . . p k a k .
For example, since there are two distinct primes in factorizing 10 = 2 * 5, therefore, µ(10) = (−1) 2 . Also, there are no distinct primes in 9 = 3 2 , hence, µ(9) = 0 [1]. A function f is said to be multiplicative if for all positive integers m, n such thatm, n are relatively primes, then f (mn) = f (m) f (n) [2]. A function f is said to be completely multiplicative if for all positive integers m, n, we have f (mn) = f (m) f (n) [3]. The Liouville's λ-function is an important example of a completely multiplicative function [3], whereas, the Möbius µ-function is multiplicative [2]. Salih and Ibrahim in [4] defined the generalized Euler's Φ-function of a graph which is summation of the Euler's Φ-function of degree of the vertices of a graph and it is denoted by Φ(G). The general form of Euler's Φ-function of some standard graphs is known. For all other standard terminologies and notations we follow [5][6][7][8][9][10].
In this paper, we utilize two number theory functions called the Liouville's λ-function and the Möbius µ-function into graph theory in order to define new functions called the generalized Liouville's Λ-function Λ(G) and the generalized Möbius M-function M(G) of a graph G, which are defined as the sum of the Liouville's λ-function and the Möbius µ-function of the degree of vertices of a graph G, respectively. In addition, the generalized Liouville's and Möbius functions of some standard graphs are determined along with determining the relationships between the two functions.

Generalized the Liouville's and Möbius Functions of Some Standard Graphs
In this section, the generalized Liouville's and Möbius functions of some important graphs which are the path graph P n , cycle graph C n , complete graph K n , complete bipartite graph K (m,n) , k-partite graph K (m 1 ,m 2 ,m n ) , star graph S n , and wheel graph W n are determined. Definition 1. Let G be a simple connected graph. The generalized Liouville,s Λ-function is defined as the sum of the Liouville λ-function of the degree of vertices v of a graph G which is denoted by Λ(G). That is

Definition 2.
Let G be a simple connected graph. The generalized Möbius M-function is defined as the sum of the Möbius µ-function of the degree of vertices v of a graph G which is denoted by M(G). That is In the following propositions, we determine general form and exact values of the generalized Liouville Λ-function and the generalized Möbius µ-function of some standard graphs.
7. The generalized Liouville Λ-function of the Wheel graph G = W n , for n ≥ 4 vertices, is Λ(

Proof.
1. In the path graph P n of order n, if n = 2, we have two vertices of degree one, then we have Λ(P 2 ) = λ(1) + λ(1) = 2. If n ≥ 3, we have two vertices of degree one and n − 2 vertices of degree two, then we have: . . .
2. There are n vertices of degree two in a cycle graph C n of order n, hence we have: 3. There are n vertices of degree n − 1 in a complete graph K n of order n, hence we have: 4. There are m vertices of degree n and n vertices of degree m in a complete bipartite graph K m,n of order m + n, hence we have: There are n − 1 vertices of degree one and there is one vertex of degree n − 1, say v 1 , in a star graph S n of order n, hence we have: 6. There are m i vertices of degree ∑ j =i m j where j, i = 1, 2, . . . , n in a complete k-partite graph K m 1 ,m 2 ,...,m n of order m 1 + m 2 + · · · + m n , hence we have: 7. There are n − 1 vertices of degree three and we have one vertex of degree n − 1, say v 1 , in a wheel graph W n of order n, hence we have: 5. The generalized Möbius M-function of the star graph G = S n , for n ≥ 2 vertices, is  where (n − 1) = p 1 a 1 p 2 a 2 . . . p k a k .
Proof. The proof is similar to the Proposition 1.

Summing up generalized the Liouville Λ-function and generalized the Möbius M-function over the divisor d and their proofs
In this section, we give some new results of finding the sum of the generalized Liouville Λ-function and the generalized tMöbius M-function extending over the divisor d which are the sum of the Liouville λ-function and the Möbius µ-function of the divisor of degree of vertices of the above standard graphs.
m + n i f n is a square n otherwise i f m is a square; m i f n is a square 0 otherwise otherwise. . . . . . . .

Proof.
1. There are two vertices of degree 1 and (n − 2) vertices of degree 2 in a path graph (P n ): 2. There are n vertices of degree 2 in a cycle graph (C n ): 3. There are n vertices of degree (n − 1) in a complete graph K n : When (n − 1) ≥ 3 is a square and by the fact that any square number has odd number of divisors and hence we always have the term λ(n − 1) at the end of the sum which is equal to 1 and all the others by the definition of Liouvile λ-function are canceled. Thus When (n − 1) ≥ 3 is not a square. There are two cases: 4. There are m vertices of degree n and n vertices of degree m in a complete bipartite graph K m,n : When m is square. There are two cases: Case 1: If n is a square. By the fact that any square number has odd number of divisors and hence we always have the term (λ(m) = 1) and (λ(n) = 1) left in S 1 and S 2 respectively and all the other terms in S 1 and S 2 are canceled by the definition of Liouville λ-function, i.e., ∑ v∈V(K m,n ), d|deg(v)

Case 2:
If n is not a square, then all the terms in S 2 are canceled by the definition of Liouville λ-function because there are always even number of divisors of n in S 2 . Since m is a square, then (λ(m) = 1) is the only term left in S 1 . Hence, From the above two cases when m is a square, we obtain that When m is not a square. There are also two cases: Case 1: If n is a square, then (λ(n) = 1) is the only term left in S 2 . Since m is not a square, so all the terms in S 1 are canceled and thus S 1 = 0. Hence, = n * (0) + m * (λ(n)) = m.

Case 2:
If n is not a square and since m is also not a square, then all the terms in S 1 and S 2 are canceled and hence S 1 = S 2 = 0. Thus From the two cases above when m is not a square, we obtain that In order to prove S, there are two cases: Case 1: If (n − 1) is square and by the fact that any square number has odd number of divisors, the term λ(n − 1) = 1 is always left in S, i.e., S = ∑ d|(n−1) λ(d) = λ(n − 1) = 1. µ(p i 1 p i 2 . . . p i j ) = −1. Therefore, for every v ∈ V(G), we have λ(deg(v)) = (−1) a 1 +a 2 +···+a k = (−1) j . Thus the theorem is proved.  Proof. The prove follows from the Theorem 3.
Proof. The proof is straightforward as λ and µ are multiplicative functions and deg(v) is the product of distinct primes.