Annals of Pure and Applied Mathematics

Vol. 29, No. 1, 2024, 9-17

ISSN: 2279-087X (P), 2279-0888(online)
Published on 14 January 2024
www.researchmathsci.org
DOI: http://dx.doi.org/10.22457/apam.v29n1a02928

Some New Results in Cubic Graphs

Farshid Mofidnakhaei
Department of Physics, Sari Branch, Islamic Azad University, Sari, Iran
Email: [email protected]
Received 24 November 2023; accepted 5 January 2024
Abstract. In this paper, two new operations on cubic graphs, namely, maximal product and
residue product were presented, and some results concerning their degrees were introduced.
Likewise, we presented certain types of cubic graphs, including totally irregular, strongly
irregular, and strongly totally irregular cubic graphs, which are described for the first time
here.
Keywords: Cubic set, cubic graph, maximal product, strongly irregular.
AMS Mathematics Subject Classification (2010): 05C99, 03E72
1. Introduction
Graph theory serves as an exceptionally beneficial tool in solving combinatorial problems
in various fields, such as geometry, algebra, number theory, topology, and social systems.
A graph basically holds a model of relations, and it is used to depict the real-life problems
encompassing the relationships among objects. To represent the objects and the relations
between objects, the graph vertices and edges are employed, respectively. Fuzzy graph
models are helpful mathematical tools in order to address the combinatorial problems in
various fields incorporating research, optimization, algebra, computing, and topology. Due
to the natural existence of vagueness and ambiguity, fuzzy graphical models are noticeably
better than graphical models. Originally, fuzzy set theory was required to deal with many
multifaceted issues, which are replete with incomplete information. In 1965, fuzzy set
theory was first suggested by Zadeh [42]. Fuzzy set theory is a highly powerful
mathematical tool for solving approximate reasoning-related problems. Jun et al. [11]
introduced cubic sets. Later on, Muhiuddin et al. [14-16] applied the notion cubic sets on
different aspects. The first description of fuzzy graphs was proposed by Kafmann [12] in
1993, taken from Zadeh’s fuzzy relations [43-44] . However, Rosenfeld [31] described
another detailed definition, including fuzzy vertex and fuzzy edges and various fuzzy
analogs of graphical theoretical concepts, including paths, cycles, connectedness, etc.
Akram et al. [1,2] presented new definitions of fuzzy graphs. Rashmanlou et al. [22-29]
investigated different concepts on cubic graphs, vague graphs, and bipolar fuzzy graphs.
Samanta et al. [32,33] introduced fuzzy competition graphs and some properties of
irregular bipolar fuzzy graphs. Borzooei and Rashmanlou [3-6] studied new concepts on
vague graphs. Gani and Radha [17,18] recommended regular fuzzy graphs and totally
regular fuzzy graphs. Kumaravel and Radha [30] described the concepts of the edge degree

9
 Farshid Mofidnakhaei
and the total edge degree in regular fuzzy graphs. Latha and Gani defined neighborly
irregular fuzzy graphs and highly irregular fuzzy graphs. Sunitha et al. [34,35] presented
new concepts for fuzzy graphs. Talebi et al. [37-41] represented several concepts on
interval-valued fuzzy graphs, intuitionistic fuzzy graphs, and bipolar fuzzy graphs. Shoaib
et al. [36] given some results on pythagorean fuzzy graphs. Ghorai et al. [7-10] studied
novel concepts in fuzzy graphs. Pal et al. [19-21] investigated several results on fuzzy
graphs.
In this research, two new operations on cubic graphs, namely, maximal product
and residue product were presented, and some results concerning their degrees were
introduce. Also, we presented certain types of cubic graphs, including totally irregular,
strongly irregular and strongly totally irregular cubic graphs.

A fuzzy graph is of the from
= ,  which is a pair of mappings : → 0,1 and
2. Preliminaries

: × → 0,1 as is defined as ,  ≤  ∧ , ∀,  ∈ , and  is a

symmetric fuzzy relation on  and ∧ denotes minimum.
Let  be a non-empty set. A function :  →  is called an interval-valued fuzzy
set (shortly, IVF set) in . Let   stands for the set of all IVF sets in . For every  ∈
 and  ∈ ,  =  ,   is called the degree of membership of an element
 ∈ , where  :  →  and  :  →  are fuzzy sets in  which are called a lower fuzzy
set and upper fuzzy set in , respectively. For simplicity, we denote  =  ,  . For
every ,  ∈   , we define  ⊆  if and only if  ≤ , for all  ∈ .
Definition 2.1. Let  = ,  , and  = ,   be two interval valued fuzzy sets in
. Then, we define
min{, } = min{ ,  }, min{ ,  },
max{, } = max{ ,  }, max{ ,  }.
Definition 2.2. Let  be a non-empty set. By a cubic set in , we mean a structure  =
{⟨, , ):  ∈ ⟩} in which  is an interval-valued fuzzy sets in  and ) is a fuzzy set
in . A cubic set  = {⟨, , ):  ∈ ⟩} is simply denoted by  = ⟨, )⟩. The
collection of all cubic sets in  is denoted by +,.
Definition 2.3. A cubic graph is a triple - = 
∗ , ,, / where
∗ =  , 0 is a graph,
, = 13,
2 )2  is a cubic set on and / = 413, 5 )5 6 is a cubic set on × so that
13
5 ≤ min{1 3,
2 1
3}
2 and ) 5  ≥ 8{) 2 , ) 2 }.

Definition 3.1. Let -9 = ,9 , /9  and -: = ,: , /:  be two cubic graphs with underlying
3. New concepts of cubic graphs

crisp graphs
9 =  9 , 09  and
: =  : , 0: , respectively. -9 ∗ -: = ,, / is called

maximal cubic graph with underlying crisp graph
=  , 0, where = 9 × : and 0 =
{9 , 9 : , : | 9 = : , 9 : ∈ 0: = 9 = : , 9 : ∈ 09 }.

10
 Some New Results in Cubic Graphs
413
2@ ∗ 13 2@ , 13
2A 6,  = max{13 2A },
> ?4)2 ∗ )2 6,  = min{)2 , )2 },
@ A @ A
B= 8CC ,  ∈ = 9 × :
⎧413 5A 649 , 9 : , : 6 = max G13
5@ ∗ 13 2@ 9 , 13
5A 9 : H ,
>> : , : 6 = min G)2@ 9 , )5A 9 : H ,
⎨4)5@ ∗ )5A 649 , 9
⎩9 = : , 9 : ∈ 0: ,
⎧413 5A 649 , 9 : , : 6 = max G13
5@ ∗ 13 2A 9 , 13
5@ 9 : H ,
>>> 4) ∗ ) 64 ,   ,  6 = min G)  , )   H ,
⎨ 5@ 5A 9 9 : : 2A 9 5@ 9 :
⎩9 : ∈ 09 , 9 = : .

Theorem 3.2. The maximal product of two cubic graphs -9 and -: , is a cubic graph, too.
Proof: Let -9 = ,9 , /9  and -: = ,: , /:  be two cubic graphs and
49 , : 9 , : 6 ∈ 09 × 0: . Then, by Definition 3, we have two cases:
> 9 = 9 = 

413 5A 64, : , : 6 = max G13

5@ ∗ 13 5A : : H
2@ , 13

≤ max I13 2A : , 13

2@ , minJ13 5A : KL

2@ , 13
= min ImaxJ13 2A : K, maxJ13
2@ , 13
2A : KL

= min{413 2A 6, : , 413

2@ ∗ 13 2A 6, : },
2@ ∗ 13

4)5@ ∗ )5A 64, : , : 6 = min{)2@ , )2A : : }

≥ min I)2@ , maxJ)2A : , )2A : KL
= max IminJ)2@ , )2A : K, minJ)2@ , )2A : KL
= maxJ4)2@ ∗ )2A 6, : , 4)2@ ∗ )2A 6, : K.

> if : = : = M

413
5@ ∗ 13 5@ 9 9 , 13
5A 649 , M9 , M6 = max{13 2A M}

2@ 9 , 13
≤ maxJminJ13 2@ 9 K, 13
2A MK

2@ 9 , 13
= min ImaxJ13 2A MK, maxJ13
2@ 9 , 13
2A MKL

= minJ413
2@ ∗ 13
2A 69 , M, 413
2@ ∗ 13
2A 69 , MK,

11
 Farshid Mofidnakhaei
4)5@ ∗ )5A 649 , M9 , M6 = min{)5@ 9 9 , )2A M}
≥ minJmaxJ)2@ 9 , )2@ 9 K, )2A MK
= max IminJ)2@ 9 , )2A MK, minJ)2@ 9 , )2A MKL
= maxJ4)2@ ∗ )2A 69 , M, 4)2@ ∗ )2A 69, MK.

Hence, -9 ∗ -: is a cubic graph. ◻

Definition 3.3. A Cubic graph - = ,, / is strong if: 13

5 = 13
2 ∧
13,
2 ) 5  = ) 2  ∨ )2 , for all  ∈ 0.

Theorem 3.4. The maximal product of two strong cubic graphs -9 and -: , is a strong

Proof: Let -9 = ,9 , /9  and -: = ,: , /:  be two strong cubic graphs. Then
cubic graph.

5@ 9 :  = min G13

13 2@ 9 , 13
2@ : H, )5@ 9 :  = max G)2@ 9 , )2A : H, for

5A 9 :  = min G13

any 9 : ∈ 09 and 13 2@ 9 , 13
2A : H, )5A 9 :  =

max G)2@ 9 , )2A : H, for any 9 : ∈ 0: . Then, proceeding according to the definition

> if 9 = : and 9 : ∈ 0: . Then,

of maximal product,

413 5A 649 , 9 : , : 6 = max{13

5@ ∗ 13 2@ 9 , 13
5A 9 : }

2@ 9 , minJ13
= max I13 2A 9 , 13
2A : KL

2@ 9 , 13
= min ImaxJ13 2A 9 K, maxJ13
2@ 9 , 13
2A : KL

= minJ413 2A 69 , 9 , 413

2@ ∗ 13 2A 69 , : K,
2@ ∗ 13

4)5@ ∗ )5A 649 , 9 : , : 6 = min{)2@ 9 , )5A 9 : }

= min I)2@ 9 , maxJ)2A 9 , )2A : KL
= max IminJ)2@ 9 , )2A 9 K, minJ)2@ 9, )2A : KL
= maxJ4)2@ ∗ )2A 69 , 9 , 4)2@ ∗ )2A 69 , : K.

>> if 9 = : and 9 : ∈ 09 . Then

413 5A 649 , 9 : , : 6 = max{13

5@ ∗ 13 5@ 9 : , 13
2A : }

2@ 9 , 13
= maxJminJ13 2A : K, 13
2A : K

2@ 9 , 13
= min ImaxJ13 2A : K, maxJ13
2@ : , 13
2A : KL

= minJ413 2A 69 , : , 413

2@ ∗ 13 2A 6: , : K,
2@ ∗ 13

12
 Some New Results in Cubic Graphs
4)5@ ∗ )5A 649 , 9 : , : 6 = min{)5@ 9 : , )2A : }
= minJmaxJ)2@ 9 , )2@ : K, )2A : K
= max IminJ)2@ 9 , )2A : K, minJ)2@ : , )2A : KL
= maxJ4)2@ ∗ )2A 69 , : , 4)2@ ∗ )2A 6: , : K.

Therefore, -9 ∗ -: is a strong cubic graph. ◻

Remark 3.5. If the maximal product of two cubic graphs -9 ∗ -:  is a strong, then -9 and
-: need not to be strong, in general.

Definition 3.6. A cubic graph - is called complete if: 13

5 = 13
2 ∧ 13,
2

)5  = )2  ∨ )2 , for all ,  ∈ .

graph, in general. Because we do not include the case 9 , :  ∈ 09 and 9 , :  ∈ 0: in
Remark 3.7. The maximal product of two complete cubic graphs is not a complete cubic

the definition of the maximal product of two cubic graphs.

Remark 3.8. The maximal product of two complete cubic graphs is strong cubic graph.
Definition 3.9. The residue product -9 • -: of two cubic graphs -9 = ,9 , /9  and -: =
,: , /:  is defined as:

413 2A 649 , : 6 = max{13

2@ • 13 2@ 9 , 132A : },
> ?4)2 • )2 649 , : 6 = min{)2 9 , )2 : },
@ A @ A
B= 8CC 9 , :  ∈ 9 × :
413
5@ • 135A 649 , : 9 , : 6 = 13 5@ 9 9 ,
>> ?4)5 • )5 649 , : 9 , : 6 = )5 9 9 ,
@ A @
B= 8CC 9 9 ∈ 09 , : ≠ : .

Example 3.10. Consider the cubic graphs -9 and -: as in Figure 1. The residue product
of -9 and -: (-9 • -: ) shown in Figure 2.
Definition 3.11. Let - be a cubic graph. The degree of a vertex  in - is defined by:

QR  = S∑UVW 135 , ∑UVW )5 Y = 4Q 2 , Q 5 6

W∈X W∈X

Definition 3.12. An cubic graph - is said to be an irregular cubic graph if there is a

vertex which is adjacent to vertices with distinct degrees.
Definition 3.13. A cubic graph - is said to be a totally irregular cubic graph if ∃ a
vertex which is adjacent to vertices with different total degree.
Definition 3.14. A cubic graph - is said to be a strongly irregular cubic graph if every
vertex has a different degree.

13
 Farshid Mofidnakhaei

Figure 1: Cubic graphs -9 and -:

Figure 2: Residue product of two cubic graphs.

Definition 3.15. A cubic graph - is said to be a strongly totally irregular cubic graph if
every vertex has a different total degree.

14
 Some New Results in Cubic Graphs
Proposition 3.16. The residue product of two cubic graphs -9 and -: is a cubic graph.
Proof. Let -9 = ,9 , /9  and -: = ,: , /:  be two cubic graphs and
49 , : 9 , : 6 ∈ 09 × 0: . If 9 9 ∈ 09 and : ≠ : , then we have:

413 5A 649 , : 9 , : 6 = 13

5@ • 13 5@ 9 9 
≤ min{13 2@ 9 , 13
2@ 9 }

2@ 9 , 13
≤ maxJmin{13 2@ 9 }, min{13
2A : , 13
2A : }K

2@ 9 , 13
= minJmax{13 2@ 9 }, max{13
2A : , 13
2A : }K
= min[413 2A 69 , : , 413
2@ • 13 2A 69 , : K,
2@ • 13

4)5@ • )5A 649 , : 9 , : 6 = )5@ 9 9 

≥ max{)2@ 9 , )2@ 9 }
≥ minJmax{)2@ 9 , )2@ 9 }, max{)2A : , )2A : }K
= maxJmin{)2@ 9 , )2@ 9 }, min{)2A : , )2A : }K
= max[4)2@ • )2A 69 , : , 4)2@ • )2A 69 , : K.

4. Conclusion
Cubic graphs are highly practical tools for the study of different computational intelligence
and computer science domains. Cubic graphs have many applications in different sciences
such as topology, natural networks, and operation research. Operations are conveniently
used in many combinatorial applications; hence; in this paper, two new operations on cubic
graphs, namely, maximal product, and residue product were presented, and some results
concerning their degrees were introduced. In our future work, we will discuss several types
of domination in cubic graphs.
Acknowledgements. The author is also thankful to the referees for their valuable comments
for improvement of the comments.

Conflicts of Interest: This is a single-authored paper. There is no conflict of Interest.

Author’s Contributions: This is the authors’ sole contribution.

REFERENCES
1. M.Akram, Interval-valued fuzzy graphs, Computers and Mathematics with
Applications, 61 (2) (2011) 289-299.
2. M. Akram and M. Sitara, Certain concepts in intuitionistic neutrosophic graph
structures, Information, (2017) 8, 154, doi:10.3390/info8040154.
3. R.A. Borzooei and H. Rashmanlou, Ring sum in product intuitionistic fuzzy graphs, J.
Adv. Res. Pure Math, 7 (2015) 16-31.
4. R.A. Borzooei and H. Rashmanlou, Domination in vague graphs and its applications,
J. Intel-Ligent Fuzzy Syst, 29 (2015) 1933-1940.

15
 Farshid Mofidnakhaei
5. R.A. Borzooei and H. Rashmanlou, Degree of vertices in vague graphs, J. Appl. Math.
Inform, 33 (2015) 545-557.
6. R.A. Borzooei, H. Rashmanlou, S. Samanta and M. Pal, Regularity of vague graphs, J.
Intell. Fuzzy Syst, 30 (2016) 3681-3689.
7. G. Ghorai and M. Pal, Planarity in vague graphs with application, Acta Mathematica,
33(2) (2017) 147-164.
8. G. Ghorai and M. Pal, On some operations and density of m-polar fuzzy graphs, Pacific
Science Review A: Natural Science and Engineering, 17 (1) (2015) 14-22.
9. G. Ghorai and M. Pal, A note on “Regular bipolar fuzzy graphs” Neural Computing
and Applications 21 (1)(2012) 197–205, Neural Computing and Applications, 30
(2018) 1569-1572.
10. G. Ghorai and M. Pal, Novel concepts of strongly edge irregular m-polar fuzzy graphs,
International Journal of Applied and Computational Mathematics, 3 (2017) 3321-
3332.
11. Y.B. Jun, Ch.S. Kim and K.O. Yang, Cubic sets, Annals of Fuzzy Mathematics and
Informatics, 4 (1) (2012) 83-98.
12. A. Kauffman, Introduction a la theories des sous-emsembles 503 ous. Masson Cie
1973, 1, 607-618.

New concept of cubic graph with application, J. of Mult.-Valued Logic & Soft
13. P.K. Kishore Kumar, Yahya Talebi, H. Rashmanlou, A.A. Talebi and F. Mofidnakhaei,

Computing, 33 (2019) 135-154.

14. G. Muhiuddin, S.S. Ahn, C.S. Kim and Y.B. Jun, Stable cubic sets, Journal of
Computational Analysis and Applications, 23(5) (2017) 802-819.
15. G. Muhiuddin, F. Feng and Y.B. Jun, Subalgebras of BCK/BCI-algebras based on
cubic soft sets, The Scientific World Journal, 2014 (2014) Article ID 458638, 9.
16. G. Muhiuddin and A.M. Al-roqi, Cubic soft sets with applications in BCK/BCI-
algebras, Annals of Fuzzy Mathematics and Informatics, 8 (2) (2014) 291-304.
17. A. Nagoorgani and S.R. Latha, On irregular fuzzy graphs, Appl. Math. Sci., 6 (2012)
517-523.
18. A. Nagoorgani and K. Radha, On regular fuzzy graphs, J. Phys. Sci,, 12 (2008) 33-44.
19. M. Pal, S.K.Khan and A.K.Shyamal, Intuitionistic fuzzy matrices, Notes on
Intuitionistic Fuzzy Sets, 8 (2) (2002) 51-62.
20. M. Pal, Fuzzy matrices with fuzzy rows and columns, Journal of Intelligent & Fuzzy
System, 30 (1) (2016) 561-573.
21. M.Pal, S. Samanta and G. Ghorai, Modern Trends in Fuzzy Graph Theory, Springer,
2020.

Intelligent & Fuzzy Systems, (2016) 30, 371-382.

22. H.Rashmanlou and R.A.Borzooei, Product vague and its applications, Journal of

23. H.Rashmanlou and R.A.Borzooei, Vague graphs with application, J. Intell. Fuzzy Syst,,
30 (2016) 3291-3299.
24. H.Rashmanlou, S.Samanta, M.Pal and R.A.Borzooei, A study on bipolar fuzzy graphs.
J. Intell. Fuzzy Syst,, 2015, 28, 571-580.
25. H. Rashmanlou, Y.B. Jun and R.A. Borzooei, More results on highly irregular bipolar
fuzzy graphs, Ann. Fuzzy Math. Inform, 8 (2014) 149-168.

16
 Some New Results in Cubic Graphs
26. H. Rashmanlou, R.A. Borzooei, M. Shoaib, Yahya Talebi, M. Taheri and F.

Valued Logic & Soft Computing, 34 (2020) 451-460.

Mofidnakhaei, New way for finding shortest path problem in a network, J. of Mult.-

27. H.Rashmanlou, S.Samanta, M.Pal and R.A.Borzooei, Bipolar fuzzy graphs with
Categorical properties, International Journal of Computational Intelligence Systems,
8(5) (2015) 808-818.
28. H.Rashmanlou, G.Muhiuddin, S.K.Amanathulla, F.Mofidnakhaei and M.Pal, A study
on cubic graph with novel application, Journal of Intelligent and Fuzzy Systems, 40
(2021) 89-101.
29. H.Rashmanlou, R.A.Borzooei, S.Samanta and M.Pal, Properties of interval valued
intuitionistic (s,t)-fuzzy graphs, Pacific Science Review A: Natural Science and
Engineering, 18 (1) (2016) 30-37.
30. H.Rashmanlou and R.A.Borzooei, New concepts of interval-valued intuitionistic (S,
T)-fuzzy graphs, Journal of Intelligent & Fuzzy Systems, 30 (4) (2016) 1893-1901.
31. K.Radha and N.Kumaravel, Some properties of edge regular fuzzy graphs, Jamal
Acad. Res. J, (2014) 121-127.
32. A.Rosenfeld, Fuzzy graphs, Fuzzy Sets and their Applications; Zadeh, L.A., Fu, K.S.,
Shimura, M., Eds.; Academic Press: New York, NY, USA, 1975; 77-95.
33. S.Samanta and M.Pal, Irregular bipolar fuzzy graphs, Int. J. Appl. Fuzzy Sets, 2 (2012)
91-102.
34. S.Samanta and M.Pal, Fuzzy k-competition graphs and pcompetition fuzzy graphs,
Fuzzy Inf. Eng, 5 (2013) 191-204.
35. M.S.Sunitha and S.Mathew, Fuzzy graph theory: A survey, Ann. Pure Appl. Math., 4
(2013) 92-110.
36. M.S.Sunitha and A.Vijayakumar, Complement of a fuzzy graph, Indian J. Pure Appl.
Math, 33 (2002) 1451-1464.
37. M.Shoaib, S.Kosari, H.Rashmanlou, M.Aslam Malik, Y.Rao, Yahya Talebi and

application, J. Mult.-Valued Logic & Soft Computing, 34 (2020) 553-586.

F.Mofidnakhaei, Notion of complex Pythagorean fuzzy graph with properties and

intuitionistic fuzzy graph with applications, J. Mult.-Valued Logic & Soft Computing,
38. A.A.Talebi, Janusz Kacprzyk, H.Rashmanlou and S.H.Sadati, A new concept of an

35 (2020) 431-454.

competition graph, J. Mult.-Valued Logic & Soft Computing, 34 (2020) 335-364.

39. A.A.Talebi, H.Rashmanlou and S.H.Sadati, Interval-valued intuitionistic fuzzy

40. A.A.Talebi, H.Rashmanlou and S.H.Sadati, New concepts on m-polar interval-valued

intuitionistic fuzzy graph, TWMS J. App. and Eng. Math, 10 (3) (2020) 806-818.
41. A.A.Talebi and H.Rashmanlou, Isomorphic on interval-valued fuzzy graphs, Annals of
fuzzy Mathematics and Informatics, 6 (1) (2013) 47-58.
42. A.A.Talebi, H.Rashmanlou and N.Mehdipoor, Isomorphism on vague graphs, Annals
of Fuzzy Mathematics and Informatics, 6 (3) (2013) 575-588.
43. L.A.Zadeh, Fuzzy sets, Information and Control, 8 (1965) 338-353.
44. L.A.Zadeh, Similarity relations and fuzzy ordering, Information Sciences, 3 (1971)
177-200.
45. L.A.Zadeh, Is there a need for fuzzy logic? Information Sciences, 178 (2008) 2751-
2779.

17