Cubic Graphs and Their Application to a Traffic Flow Problem

Abstract

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we introduce the concept of cubic graph, which is different from the notion of cubic graph in S. Rashid, N. Yaqoob, M. Akram, M. Gulistan, Cubic graphs with application, Int. J. Anal. Appl. 16 (2018), 733-750, and investigate some of their interesting properties. Then we define the notions of cubic path, cubic cycle, cubic diameter, strength of cubic graph, complete cubic graph, strong cubic graph and illustrate these notions by several examples. We prove that any cubic bridge is strong and we investigate equivalent condition for cubic cutvertex. Finally, we use the concept of cubic graphs in traffic flows to get the least time to reach the destination.

Preservation of the Classical Meanness Property of Some Graphs Based on Line Graph Operation

“…A classical mean labeling is for getting more accuracy of all the edge labeling by using the average of four different types of means of the vertex labeling of the given graph. Recently, Muhiuddin et al studied various related concepts on graphs (see [18][19][20][21][22]).…”

New Perspectives on Classical Meanness of Some Ladder Graphs

“…In addition, more concepts of ladder graphs and related concepts have been studied in [16][17][18][19][20][21][22][23][24]. Recently, Muhiuddin et al have applied various related concepts on graphs in different aspects (see, e.g., [25][26][27][28][29][30][31]).…”

Reinforcement Number of a Graph with respect to Half-Domination

“…Total reinforcement number of a graph has been studied in [9][10][11][12]. Recently, Muhiuddin et al have studied various related concepts on graphs (see, e.g., [13][14][15][16][17]).…”