2 Face Irregular strength of grid graph ![](//:0)
![](//:0)
Let ![](//:0)
, where ![](//:0)
,
![](//:0)
and
![](//:0)
![](//:0)
Theorem 5.
Let ![](//:0)
be a positive integers and ![](//:0)
be grid graph, then
![](//:0)
![](//:0)
Proof.
According to (1) it is sufficient to show that ![](//:0)
. So we define the face irregular k-labeling ρ of type (1, 0, 0) of ![](//:0)
in the following way
![](//:0)
![](//:0)
The weight of the face f under labeling ρ of type (1, 0, 0) is defined as
![](//:0)
![](//:0)
The differences between the weights of the horizontal faces will be calculated as follows:
![](//:0)
![](//:0)
Let, ![](//:0)
and ![](//:0)
be two horizontal consecutive faces. Then,
![](//:0)
![](//:0)
Now we compute differences between the weights of the vertical faces will be calculated as follows:
![](//:0)
![](//:0)
Let, ![](//:0)
and ![](//:0)
be two vertical consecutive faces. Then,
![](//:0)
![](//:0)
Hence it follows that the weights of any two faces f and g are distinct. Complete the proof by clearly giving the two required inequalities. □
Theorem 6.
Let ![](//:0)
be a positive integers and ![](//:0)
be grid graph, then
![](//:0)
![](//:0)
Proof.
We define a face irregular k-labeling ρ of type (0, 1, 0) of G in the following way
![](//:0)
![](//:0)
The weight of the face f under the labeling ρ of type (0, 1, 0) is
![](//:0)
![](//:0)
Now we calculate differences between the weights of the horizontal faces as follows:
Let, ![](//:0)
and ![](//:0)
be two horizontal consecutive faces.
Then for ![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
Now we calculate the differences between the weights of the vertically adjacent faces as follows:
Let, ![](//:0)
and ![](//:0)
be two vertical consecutive faces.
Then for ![](//:0)
![](//:0)
![](//:0)
For, ![](//:0)
![](//:0)
![](//:0)
For, ![](//:0)
![](//:0)
![](//:0)
![](//:0)
For, ![](//:0)
![](//:0)
![](//:0)
For, ![](//:0)
![](//:0)
![](//:0)
Hence it follows that the weights of any two faces f and g are distinct. Complete the proof by clearly giving the two required inequalities. □
Theorem 7.
Let ![](//:0)
be a positive integers and ![](//:0)
be grid graph, then
![](//:0)
![](//:0)
Proof.
We define vertex-face labeling ρ of type (1, 0, 1) of G in the following way
![](//:0)
![](//:0)
The weight under labeling ρ of type (1, 0, 1) can be defined as
![](//:0)
![](//:0)
The differences between the weights of every two horizontally adjacent faces will be calculated as follows:
Let, ![](//:0)
and ![](//:0)
be two horizontal consecutive faces.
Then for ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
Now we measure the differences between the weights for every two vertically adjacent faces:
Let, ![](//:0)
and ![](//:0)
be two vertical consecutive faces.
Then for ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
Hence it follows that the weights of any two faces f and g are distinct. Complete the proof by clearly giving the two required inequalities. □
Theorem 8.
Let ![](//:0)
be a positive integers and ![](//:0)
be grid graph, then
![](//:0)
![](//:0)
Proof.
We define a k-labeling ρ of type (0, 1, 1) of G in the following way
![](//:0)
The face labels are defined as
![](//:0)
![](//:0)
The weights can be defined as
![](//:0)
![](//:0)
The differences between the horizontal weights for every two adjacent faces are as follows: Let, ![](//:0)
and ![](//:0)
be two horizontal consecutive faces.
Then for ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
Now the differences between the weights of every two adjacent vertical faces of type (0, 1, 1) are as follows:
Let, ![](//:0)
and ![](//:0)
be two vertical consecutive faces. Then,
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
and ![](//:0)
![](//:0)
![](//:0)
Hence it follows that the weights of any two faces f and g are distinct. Complete the proof by clearly giving the two required inequalities. □
Theorem 9.
Let ![](//:0)
be a positive integers and ![](//:0)
be grid graph, then
![](//:0)
![](//:0)
Proof.
Consider, an integer ![](//:0)
such that ![](//:0)
. Then the entire face irregular labeling is defined as follow
![](//:0)
![](//:0)
For ![](//:0)
the face labels are as follows
![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
the horizontal edges labels are as follow
![](//:0)
![](//:0)
The weight of a face is defined as
![](//:0)
![](//:0)
Now we calculate the difference between the weights for every two adjacent horizontal faces in each row as follow.
Let, ![](//:0)
and ![](//:0)
be two horizontal consecutive faces. Then,
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
Now the calculate the difference between the weights for every two adjacent vertical faces as follow.
Let, ![](//:0)
and ![](//:0)
be two vertical consecutive faces.
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
Since ![](//:0)
, for every value of i, so we have
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
![](//:0)
![](//:0)
For ![](//:0)
![](//:0)
![](//:0)
![](//:0)
Hence it follows that the weights of any two faces f and g are distinct. Complete the proof by clearly giving the two required inequalities. □