On Transmission Irregular Cubic Graphs of an Arbitrary Order

Abstract

The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G. A transmission irregular graph (TI graph) has mutually distinct vertex transmissions. In 2018, Alizadeh and Klavžar posed the following question: do there exist infinite families of regular TI graphs? An infinite family of TI cubic graphs of order $118+72k$, $k\ge 0$, was constructed by Dobrynin in 2019. In this paper, we study the problem of finding TI cubic graphs for an arbitrary number of vertices. It is shown that there exists a TI cubic graph of an arbitrary even order $n\ge 22$. Almost all constructed graphs are contained in twelve infinite families.

1. Introduction

All graphs considered in this paper are simple, i.e., they are finite, connected, undirected and without loops or multiple edges. The cardinality of the vertex set $V\left(G\right)$ of a graph G is called the order of G. The degree of a vertex v is the number of edges adjacent to v. A graph is regular if every vertex has the same degree. All vertices of a cubic or 3-regular graph have degree 3. The class of cubic graphs is especially interesting for theoretical studies and applications because various problems in graph theory remain difficult for this class. Cubic graphs are suitable models for chemical structures, in particular, for fullerenes that form carbon polyhedral cages [1]. If u and v are vertices of G, then the number of edges in a shortest path connecting them is the distance between u and v. The sum of distances from a vertex v to all the other vertices of a graph is called the transmission of v. Vertex transmissions are often used for designing various distance-based topological indices that have found numerous applications in organic chemistry and in the analysis of complex networks. For example, the Wiener index is a half of the sum of all vertex transmissions. It is used as a structural descriptor for molecular graphs of chemical compounds [2,3]. The measure of transmission diversity in a graph is the Wiener complexity, which is defined as the number of pairwise distinct transmissions of graph vertices [4,5,6,7,8]. The Wiener complexity was studied for various classes of graphs. In particular, the Wiener complexity of molecular graphs of fullerenes was considered in [5,9]. A transmission irregular graph (TI graph) has maximum Wiener complexity. It was shown that almost all graphs are not transmission irregular [10]. Infinite families of TI graphs for trees, 2-connected graphs, homeomorphic graphs, and other classes of graphs were constructed in [10,11,12,13,14,15]. The following problem was formulated in [10]: do there exist infinite families of regular TI graphs? An infinite family of transmission irregular cubic graphs of order $118+72k$, $k\ge 0$, was presented in [16]. The number of vertices of graphs in this family increases by 72.

In this paper, we deal with the problem of constructing a TI cubic graph with an arbitrary even order. It is shown that TI cubic graphs of order $n\ge 22$ can be generated by twelve infinite families except for twenty graphs.

2. Constructions of Graphs

Transmission irregular cubic graphs with a small number of vertices can be found by computer search. There are no such graphs up to 20 vertices. Cubic graphs with 22, 24, 26, 28, and 30 vertices contain 1, 34, 329, 3579, and 41,171 TI graphs, respectively. Examples of cubic TI graphs of order 22 and 24 are shown in Figure 1. Their vertex transmissions are (56, 57, 59, 60, 61, 62, 63, 64, 67, 70, 71, 73, 74, 77, 78, 80, 81, 85, 86, 88, 89, 93) and (66, 67, 70, 71, 72, 74, 75, 77, 78, 81, 83, 84, 87, 88, 89, 91, 92, 93, 95, 98, 99, 105, 108, 117).

Figure 1. Transmission irregular cubic graphs with 22 and 24 vertices.

To solve our problem, we find twenty infinite families of TI cubic graphs and show that orders of these graphs cover the set of all even integers except twenty numbers. A TI graph of any constructed family is obtained by connecting a some TI graph H of small order and a growing graph L with a periodic structure depending on some increasing parameter k. Therefore, the method for solving this problem can be divided into four stages:

(s1). finding small finite sequences of growing graphs $G_k$ that could be initial parts of infinite sequences of TI cubic graphs. The orders of graphs of these families depend on k and they must cover almost the entire set of even numbers;

(s2). derivation of analytical expressions for vertex transmissions of graph $G_k$ corresponding to every family in terms of k;

(s3). verification of the property of transmission irregularity by comparing the analytical formulas of vertex transmissions for every $G_k$;

(s4). confirmation of the correctness of the analytic formulas by computer calculations of vertex transmissions for graphs of large orders.

The simplest growing graph suitable for insertion into cubic graphs is the ladder. The ladder $L_k$ of length k consists of two paths $P_k$ in which k pairs of opposite vertices are joined by edges. In other words, $L_k$ is the Cartesian product of paths $P_2$ and $P_k$. An example of ladder $L_k$ of odd length is depicted in Figure 2, $k=2m+1$, $m\ge 0$. For convenience, the vertex numbering of the ladder will go from the vertices of degree 2 to the middle of the ladder. For a ladder of odd length, an edge equidistant from vertices $a_1,b_1,c_1,d_1$ of degree 2 will be denoted as $(x,y)$. If $m=0$, then the corresponding ladder of length 1 consists of edge $(x,y)$.

Figure 2. Examples of inserting ladder $L_k$ into graph H.

The computing search algorithm for finding the initial parts of the infinite families contains the following steps:

(a1). Remove two arbitrary disjoint edges $(v_1,v_2)$ and $(v_3,v_4)$ of a suitable TI cubic graph H of small order n, i.e., vertices $v_1$, $v_2$, $v_3$, and $v_4$ have degree 2 in H;

(a2). Insert edges $(v_i,u)$, $u\in \{a_1,b_1,c_1,d_1\}$, between vertices of ladder $L_k$ and the graph H. The resulting cubic graph $G_k$ has order $n+2k$ (see examples in Figure 2 where removed edges are depicted by dotted lines in H). If H and $L_k$ are connected, say, by edges $(v_1,c_1)$, $(v_2,a_1)$, $(v_3,b_1)$, and $(v_4,d_1)$, then we will use the notation $G_k=H(v_1,v_2,v_3,v_4)+L_k(c_1,a_1,b_1,d_1)$;

(a3). Check the periodicity of the occurrence of transmission irregular graphs $G_k$ of order $n+2k$ while increasing k. If k has a fixed increment, then put k to set K;

(a4). Select $K_1\subseteq K$ such that integers $\{n+2k|k\in K_1\}$ form the set of all even numbers except for a finite subset.

We do not find suitable initial TI graphs of small order among TI cubic graphs of order 24. The required graphs H were selected in the set of TI cubic graphs of order 26 (12 graphs). By attaching growing ladders $L_k$ to all pairs of disjoint edges in all twelve TI graphs H, one may construct the initial parts of possible infinite families.

Consider TI cubic graphs $H_1,H_2,\dots ,H_{10}$ of order 26 shown in Figure 3 (graphs $H_2$, $H_7$, and $H_8$ are non-planar). By inserting ladders of various lengths to these graphs, one can construct the following twelve infinite families of cubic graphs, $k\ge 0$:

$$\begin{array}{ccccc}{G}_{16+10k}\hfill & =\hfill & H_1(2,3,8,9)\hfill & +\hfill & L_{16+10k}(b_1,a_1,c_1,d_1),\hfill \\ G_{17+10k}\hfill & =\hfill & H_2(20,25,22,26)\hfill & +\hfill & L_{17+10k}(a_1,d_1,b_1,c_1),\hfill \\ G_{24+10k}\hfill & =\hfill & H_3(18,22,24,26)\hfill & +\hfill & L_{24+10k}(a_1,c_1,d_1,b_1),\hfill \\ G_{25+10k}\hfill & =\hfill & H_4(15,19,20,24)\hfill & +\hfill & L_{25+10k}(b_1,a_1,c_1,d_1),\hfill \\ G_{28+10k}\hfill & =\hfill & H_5(11,12,21,22)\hfill & +\hfill & L_{28+10k}(a_1,c_1,b_1,d_1),\hfill \\ G_{29+10k}\hfill & =\hfill & H_6(15,16,24,26)\hfill & +\hfill & L_{29+10k}(a_1,c_1,b_1,d_1),\hfill \\ G_{31+10k}\hfill & =\hfill & H_7(18,22,20,26)\hfill & +\hfill & L_{31+10k}(a_1,c_1,b_1,d_1),\hfill \\ G_{40+10k}\hfill & =\hfill & H_8(1,3,9,13)\hfill & +\hfill & L_{40+10k}(c_1,b_1,a_1,d_1),\hfill \\ G_{22+20k}\hfill & =\hfill & H_8(2,3,25,26)\hfill & +\hfill & L_{22+20k}(c_1,b_1,a_1,d_1),\hfill \\ G_{23+20k}\hfill & =\hfill & H_9(16,20,24,26)\hfill & +\hfill & L_{23+20k}(c_1,b_1,a_1,d_1),\hfill \\ G_{32+20k}\hfill & =\hfill & H_{10}(14,16,20,22)\hfill & +\hfill & L_{32+20k}(a_1,c_1,d_1,b_1),\hfill \\ G_{33+20k}\hfill & =\hfill & H_6(12,15,18,22)\hfill & +\hfill & L_{33+20k}(a_1,c_1,b_1,d_1).\hfill \end{array}$$

Figure 3. Transmission irregular cubic graphs of order 26.

Since the length of the growing parts of ladders is divisible by 10, it is easy to check the following property.

Proposition 1.

The union of infinite sets $\{16,17,24,25,28,29,31,40\}+10k$ and $\{22,23,32,33\}+20k$, $k\ge 0$, covers the set of all positive integers except for $1,2,\dots ,15,18,19$, $20,21,30$.

Twenty numbers outside the infinite families of Proposition 1 determine the length of ladders to be inserted into cubic graphs H of order 26. Therefore, the corresponding twenty cubic TI graphs will have orders $28,30,\dots ,56,62,64,68,86$.

To construct such graphs, it is sufficient to consider graphs $H_2$ and $H_5$ in Figure 3. Namely, it can be verified that the following cubic graphs are transmission irregular:

$$\begin{array}{ccccc}{G}_1\hfill & =\hfill & H_2(19,21,20,24)\hfill & +\hfill & L_1(a_1,b_1,c_1,d_1),\hfill \\ G_2\hfill & =\hfill & H_2(7,8,11,12)\hfill & +\hfill & L_2(a_1,d_1,b_1,c_1),\hfill \\ G_3\hfill & =\hfill & H_2(2,5,8,10)\hfill & +\hfill & L_3(a_1,b_1,c_1,d_1),\hfill \\ G_4\hfill & =\hfill & H_2(2,5,12,14)\hfill & +\hfill & L_4(a_1,b_1,c_1,d_1),\hfill \\ G_5\hfill & =\hfill & H_2(1,2,4,6)\hfill & +\hfill & L_5(a_1,b_1,c_1,d_1),\hfill \\ G_6\hfill & =\hfill & H_2(7,8,9,12)\hfill & +\hfill & L_6(c_1,b_1,a_1,d_1),\hfill \\ G_7\hfill & =\hfill & H_2(1,2,6,8)\hfill & +\hfill & L_7(a_1,b_1,c_1,d_1),\hfill \\ G_8\hfill & =\hfill & H_2(6,8,11,12)\hfill & +\hfill & L_8(b_1,a_1,c_1,d_1),\hfill \\ G_9\hfill & =\hfill & H_2(19,21,20,24)\hfill & +\hfill & L_9(a_1,c_1,b_1,d_1),\hfill \\ G_{10}\hfill & =\hfill & H_2(2,5,9,12)\hfill & +\hfill & L_{10}(a_1,c_1,b_1,d_1),\hfill \\ G_{11}\hfill & =\hfill & H_2(5,7,6,8)\hfill & +\hfill & L_{11}(b_1,a_1,c_1,d_1),\hfill \\ G_{12}\hfill & =\hfill & H_2(4,6,9,12)\hfill & +\hfill & L_{12}(a_1,c_1,d_1,b_1),\hfill \\ G_{13}\hfill & =\hfill & H_2(1,4,3,6)\hfill & +\hfill & L_{13}(a_1,b_1,c_1,d_1),\hfill \\ G_{14}\hfill & =\hfill & H_2(1,3,4,5)\hfill & +\hfill & L_{14}(a_1,b_1,c_1,d_1),\hfill \\ G_{15}\hfill & =\hfill & H_5(16,19,24,25)\hfill & +\hfill & L_{15}(a_1,b_1,c_1,d_1),\hfill \\ G_{18}\hfill & =\hfill & H_5(1,2,4,7)\hfill & +\hfill & L_{18}(a_1,b_1,c_1,d_1),\hfill \\ G_{19}\hfill & =\hfill & H_2(18,22,19,23)\hfill & +\hfill & L_{19}(c_1,b_1,a_1,d_1),\hfill \\ G_{20}\hfill & =\hfill & H_2(1,4,2,5)\hfill & +\hfill & L_{20}(a_1,b_1,c_1,d_1),\hfill \\ G_{21}\hfill & =\hfill & H_5(2,3,9,12)\hfill & +\hfill & L_{21}(a_1,c_1,b_1,d_1),\hfill \\ G_{30}\hfill & =\hfill & H_2(19,21,20,25)\hfill & +\hfill & L_{30}(a_1,b_1,c_1,d_1).\hfill \end{array}$$

Computer calculations confirm that these graphs are transmission irregular. Their ordered vertex transmissions are presented in Appendix B. Note that cubic graphs always have an even number of vertices. Graphs $G_1,G_2,\dots ,G_{30}$ together with two graphs of Figure 1 and graphs from infinite families lead to the following result.

Proposition 2.

A transmission irregular cubic graph of order n exists for all even $n\ge 22$.

3. Vertex Transmissions of Cubic Graphs

To prove Proposition 2, we find analytical expressions for vertex transmissions of every growing graph of Figure 3 as polynomials in k and then compare them with each other. The basic idea of analytic calculation of transmissions is to study how the shortest paths go through vertices of ladders. The shortest paths from graph vertices can enter the ladder $L_k$ through four vertices $a_1,b_1,c_1$, and $d_1$. This rather cumbersome method is described in detail for regular graphs of degree 3 and 4 in [16,17].

As an illustration, consider graph $G_{16+10k}$ of Figure 4 obtained from cubic graph $H_1$ of Figure 3 and calculate transmission of vertex 6. Denote by $d(v,U)$ the sum of distances from a vertex v to vertices of a set U. Let $AC=\{a_1,a_2,\dots ,a_m,c_1,c_2,\dots ,c_m\}$ and $BD=\{b_1,b_2,\dots ,b_m,d_1,d_2,\dots ,d_m\}$. Then $V\left(G_{16+10k}\right)=V\left(H_1\right)\cup AC\cup BD$. It is easy to see that the sum of distances from vertex 6 to all vertices of $H_1$ does not depend on the length of ladder $L_{16+10k}$. We have $d(6,V\left(H_1\right))=102$. The shortest paths from vertex v to vertices of $AC$ pass through the cycle of length $20+10k$ with vertex set $AC\cup \{3,6,9,d_1\}$. Then $d(6,AC)=t{r}_{C_{20+10k}}\left(6\right)-d(6,3)-d(6,9)-d(6,d_1)=(25k^2+100k+100)-4$, where $t{r}_{C_{20+10k}}\left(6\right)$ is the transmission of vertex 6 in cycle $C_{20+10k}$. The shortest paths from vertex v to vertices of $BD$ pass through the cycle with vertex set $BD\cup \{3,6,9,a_1\}$. Hence, $d(6,BD)=t{r}_{C_{20+10k}}\left(6\right)-d(6,3)-d(6,9)-d(6,a_1)=25k^2+100k+96$. As a result, we obtain $tr\left(6\right)=50k^2+200k+294$.

Figure 4. Graph $G_{16+10k}$ with a growing ladder, $m=8+5k$.

Graph $G_{16+10k}$ has the following vertex transmissions, $m=8+5k$:

$$\begin{array}{cc}\hfill tr\left(8\right)=50k^2+200k+271,& tr\left(16\right)=50k^2+240k+332,\\ \hfill tr\left(5\right)=50k^2+200k+281,& tr\left(15\right)=50k^2+240k+335,\\ \hfill tr\left(9\right)=50k^2+200k+287,& tr\left(13\right)=50k^2+250k+346,\\ \hfill tr\left(6\right)=50k^2+200k+294,& tr\left(19\right)=50k^2+260k+367,\\ \hfill tr\left(2\right)=50k^2+200k+297,& tr\left(18\right)=50k^2+260k+370,\\ \hfill tr\left(3\right)=50k^2+200k+305,& tr\left(20\right)=50k^2+260k+381,\\ \hfill tr\left(1\right)=50k^2+210k+317,& tr\left(17\right)=50k^2+265k+372,\\ \hfill tr\left(4\right)=50k^2+215k+309,& tr\left(21\right)=50k^2+275k+397,\\ \hfill tr\left(11\right)=50k^2+220k+296,& tr\left(22\right)=50k^2+280k+410,\\ \hfill tr\left(12\right)=50k^2+220k+308,& tr\left(23\right)=50k^2+280k+414,\\ \hfill tr\left(7\right)=50k^2+220k+312,& tr\left(24\right)=50k^2+280k+427,\\ \hfill tr\left(10\right)=50k^2+230k+319,& tr\left(25\right)=50k^2+300k+455,\\ \hfill tr\left(14\right)=50k^2+240k+328,& tr\left(26\right)=50k^2+300k+460,\end{array}$$

$$tr\left(a_i\right)=\left\{\begin{array}{cc}50k^2+200k+293+20i,\hfill & i=1,2,\dots ,m-1,\hfill \\ 50k^2+300k+446,\hfill & i=m,\hfill \end{array}\right.$$

$$tr\left(b_i\right)=\left\{\begin{array}{cc}50k^2+200k+298+20i,\hfill & i=1,2,\dots ,m-1,\hfill \\ 50k^2+300k+435,\hfill & i=m,\hfill \end{array}\right.$$

$$tr\left(c_i\right)=\left\{\begin{array}{cc}50k^2+200k+271+20i,\hfill & i=1,2,\dots ,m-1,\hfill \\ 50k^2+300k+430,\hfill & i=m,\hfill \end{array}\right.$$

$$tr\left(d_i\right)=\left\{\begin{array}{cc}50k^2+200k+263+20i,\hfill & i=1,2,\dots ,m-1,\hfill \\ 50k^2+300k+422,\hfill & i=m.\hfill \end{array}\right.$$

To check that there are no pairs of vertices with the same transmissions, one can examine k and i as solutions of the corresponding equalities. Note that the coefficients at k of transmissions of vertices $1,2,\dots ,26$ form a non-decreasing sequence, while the sequence of constant terms strictly increases. Therefore, the equality of any two transmissions implies $k<0$. The other possible equalities of transmissions lead to various invalid expressions. For example, $tr\left(12\right)-tr\left(a_i\right)=20k+10-20i=0$ or $tr\left(9\right)-tr\left(d_i\right)=4-20i=0$, etc. Transmissions of vertices $a_i,b_i,c_i$, and $d_i$ have the same incremental value $20i$ and coinciding coefficients at $k^2$ and k. The pairwise difference of these transmissions is provided by the difference in the remaining constant terms.

Expressions for vertex transmissions of TI cubic graphs of the infinite families are collected in Appendix A. These expressions have been additionally verified by computing vertex transmissions of all graphs using their adjacency matrices for ladders with $k\le 150$. The ordered vertex transmissions of twenty TI cubic graphs outside the constructed infinite families are presented in Appendix B.

4. Conclusions

It is shown that transmission irregular cubic graphs can have an arbitrary even number of vertices $n\ge 22$. A full list of TI cubic graphs with up to 30 vertices is also obtained (available upon request to the authors). The next natural step is to find TI quartic or 4-regular graphs for an arbitrary order. Regular graphs of degree 4 are also of interest for chemical applications. An infinite family of TI quartic graphs of order $96k+206$, $k\ge 0$, with a quite complicated structure is known [17]. The question of the existence of a transmission irregular fullerene graph is still open [9]. For computer calculations, the authors have developed software tools in programming languages Python, C++ and Delphi.