Coded caching technology can better alleviate network traffic congestion. Since many of the centralized coded caching schemes now in use have high subpacketization, which makes scheme implementation more challenging, coded caching schemes with low subpacketization offer a wider range of practical applications. It has been demonstrated that the coded caching scheme can be achieved by creating a combinatorial structure named placement delivery array (PDA). In this work, we employ vector space over a finite field to obtain a class of PDA, calculate its parameters, and consequently achieve a coded caching scheme with low subpacketization. Subsequently, we acquire a new MN scheme and compare it with the new scheme developed in this study. The subpacketization $F$ of the new scheme has significant advantages. Lastly, the number of users $K$, cache fraction $\frac{M}{N}$, and subpacketization $F$ have advantages to some extent at the expense of partial transmission rate $R$ when compared to the coded caching scheme in other articles.

We continue the study of Token Sliding (reconfiguration) graphs of independent sets initiated by the authors in an earlier paper [Graphs Comb. 39.3, 59, 2023]. Two of the topics in that paper were to study which graphs $G$ are Token Sliding graphs and which properties of a graph are inherited by a Token Sliding graph. In this paper, we continue this study specializing in the case of when $G$ and/or its Token Sliding graph ${\mathsf{T}\mathsf{S}}_k(G)$ is a tree or forest, where $k$ is the size of the independent sets considered. We consider two problems. The first is to find necessary and sufficient conditions on $G$ for ${\mathsf{T}\mathsf{S}}_k(G)$ to be a forest. The second is to find necessary and sufficient conditions for a tree or forest to be a Token Sliding graph. For the first problem, we give a forbidden subgraph characterization for the cases of $k=2,3$. For the second problem, we show that for every $k$-ary tree $T$ there is a graph $G$ for which ${\mathsf{T}\mathsf{S}}_{k+1}(G)$ is isomorphic to $T$. A number of other results are given along with a join operation that aids in the construction of ${\mathsf{T}\mathsf{S}}_k$-graphs.

In this paper, we introduce graceful and near graceful labellings of several families of windmills. In particular, we use Skolem-type sequences to prove (near) graceful labellings exist for windmills with $C_3$ and $C_4$ vanes, and infinite families of $3,5$-windmills and $3,6$-windmills. Furthermore, we offer a new solution showing that the graph obtained from the union of $t$ 5-cycles with one vertex in common ($C_5^t$) is graceful if and only if $t\equiv 0,3(\mathrm{mod}4)$ and near graceful when $t\equiv 1,2(\mathrm{mod}4)$.

We study groups generated by sets of pattern avoiding permutations. In the first part of the paper, we prove some general results concerning the structure of such groups. In particular, we consider the sequence $(G_n{)}_{n\ge 0}$, where $G_n$ is the group generated by a subset of the symmetric group $S_n$ consisting of permutations that avoid a given set of patterns. We analyze under which conditions the sequence $(G_n{)}_{n\ge 0}$ is eventually constant. Moreover, we find a set of patterns such that $(G_n{)}_{n\ge 0}$ is eventually equal to an assigned symmetric group. Furthermore, we show that any non-trivial simple group cannot be obtained in this way and describe all the non-trivial abelian groups that arise in this way. In the second part of the paper, we carry out a case-by-case analysis of groups generated by permutations avoiding a few short patterns.

We consider the eccentric graph of a graph $G$, denoted by $\mathrm{e}\mathrm{c}\mathrm{c}(G)$, which has the same vertex set as $G$, and two vertices in the eccentric graph are adjacent if and only if their distance in $G$ is equal to the eccentricity of one of them. In this paper, we present a fundamental requirement for the isomorphism between $\mathrm{e}\mathrm{c}\mathrm{c}(G)$ and the complement of $G$, and show that the previous necessary condition given in the literature is inadequate. Also, we obtain that the diameter of $\mathrm{e}\mathrm{c}\mathrm{c}(T)$ is at most 3 for any tree and get some characterizations of the eccentric graph of trees.

Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such that $p=|V(G)|$ and $q=|E(G)|$. A super edge-magic total labeling $f$ of $G$ is a bijection $f:V(G)\cup E(G)⟶\{1,2,\dots ,p+q\}$ such that for all edges $uv\in E(G)$, $f(u)+f(v)+f(uv)=c(f)$, where $c(f)$ is called a magic constant, and $f(V(G))=\{1,\dots ,p\}$. The minimum of all $c(f)$, where the minimum is taken over all the super edge-magic total labelings $f$ of $G$, is defined to be the super edge-magic total strength of the graph $G$. In this article, we work on certain classes of unicyclic graphs and provide evidence to conjecture that the super edge-magic total strength of a certain family of unicyclic $(p,q)$-graphs is equal to $2q+\frac{n+3}{2}$.

For a poset $P=C_a\times C_b$, a subset $A\subseteq P$ is called a chain blocker for $P$ if $A$ is inclusion-wise minimal with the property that every maximal chain in $P$ contains at least one element of $A$, where $C_i$ is the chain $1<\cdots <i$. In this article, we define the shelter of the poset $P$ to give a complete description of all chain blockers of $C_5\times C_b$ for $b\ge 1$.

This project aims at investigating properties of channel detecting codes on specific domains $1^{+}{0}^{+}$. We focus on the transmission channel with deletion errors. Firstly, we discuss properties of channels with deletion errors. We propose a certain kind of code that is a channel detecting (abbr. $\gamma$-detecting) code for the channel $\gamma =\delta (m,N)$ where $m<N$. The characteristic of this $\gamma$-detecting code is considered. One method is provided to construct $\gamma$-detecting code. Finally, we also study a kind of special channel code named $\tau (m,N)$-srp code.

A chemical structure specifies the molecular geometry of a given molecule or solid in the form of atom arrangements. One way to analyze its properties is to simulate its formation as a product of two or more simpler graphs. In this article, we take this idea to find upper and lower bounds for the generalized Randić index ${\mathcal{R}}_{\alpha }$ of four types of graph products, using combinatorial inequalities. We finish this paper by providing the bounds for ${\mathcal{R}}_{\alpha }$ of a line graph and rooted product of graphs.

Let $G$ be a $(p,q)$ graph. Let $f:V(G)\to \{1,2,\dots ,k\}$ be a map where $k\in \mathbb{N}$ is a variable and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $|t_f(i)–t_f(j)|\le 1$, $i,j\in \{1,2,\dots ,k\}$ where $t_f(x)$ denotes the total number of vertices and edges labeled with $x$. A graph with a $k$-total prime cordial labeling is called $k$-total prime cordial graph. In this paper, we investigate the 4-total prime cordial labeling of some graphs like dragon, Möbius ladder, and corona of some graphs.

Let $G=(V,E)$ be a graph with vertex set $V$ and edge set $E$. An edge labeling $f:E\to Z_2$ induces a vertex labeling $f^{+}:V\to Z_2$ defined by $f^{+}(v)\equiv \sum _{uv\in E}f(uv)(\mathrm{mod}2)$, for each vertex $v\in V$. For $i\in Z_2$, let $v_f(i)=|\{v\in V:f^{+}(v)=i\}|$ and $e_f(i)=|\{e\in E:f(e)=i\}|$. An edge labeling $f$ of a graph $G$ is said to be edge-friendly if $|e_f(1)–e_f(0)|\le 1$. The set $\{v_f(1)–v_f(0):f\text{ is an edge-friendly labeling of }G\}$ is called the full edge-friendly index set of $G$. In this paper, we shall determine the full edge-friendly index sets of one point union of cycles.

After the Chartrand definition of graph labeling, since 1988 many graph families have been labeled through mathematical techniques. A basic approach in those labelings was to find a pattern among the labels and then prove them using sequences and series formulae. In 2018, Asim applied computer-based algorithms to overcome this limitation and label such families where mathematical solutions were either not available or the solution was not optimum. Asim et al. in 2018 introduced the algorithmic solution in the area of edge irregular labeling for computing a better upper-bound of the complete graph $es(K_n)$ and a tight upper-bound for the complete $m$-ary tree ${es(T}_{m,h})$ using computer-based experiments. Later on, more problems like complete bipartite and circulant graphs were solved using the same technique. Algorithmic solutions opened a new horizon for researchers to customize these algorithms for other types of labeling and for more complex graphs. In this article, to compute edge irregular $k$-labeling of star $S_{m,n}$ and banana tree ${BT}_{m,n}$, new algorithms are designed, and results are obtained by executing them on computers. To validate the results of computer-based experiments with mathematical theorems, inductive reasoning is adopted. Tabulated results are analyzed using the law of double inequality and it is concluded that both families of trees observe the property of edge irregularity strength and are tight for $\lceil \frac{|V|}{2}\rceil$-labeling.

A graph $G$ is called a fractional ID-$(g,f)$-factor-critical covered graph if for any independent set $I$ of $G$ and for every edge $e\in E(G-I)$, $G-I$ has a fractional $(g,f)$-factor $h$ such that $h(e)=1$. We give a sufficient condition using degree condition for a graph to be a fractional ID-$(g,f)$-factor-critical covered graph. Our main result is an extension of Zhou, Bian, and Wu’s previous result [S. Zhou, Q. Bian, J. Wu, A result on fractional ID-$k$-factor-critical graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 87(2013) 229–236] and Yashima’s previous result [T. Yashima, A degree condition for graphs to be fractional ID-$[a,b]$-factor-critical, Australasian Journal of Combinatorics 65(2016) 191–199].

In this article, we define $q$-generalized Fibonacci polynomials and $q$-generalized Lucas polynomials using $q$-binomial coefficient and obtain their recursive properties. In addition, we introduce generalized $q$-Fibonacci matrix and generalized $q$-Lucas matrix, then we derive their basic identities. We define $(k,q,t)$-symmetric generalized Fibonacci matrix and $(k,q,t)$-symmetric generalized Lucas matrix, then we give the Cholesky factorization of these matrices. Finally, we give determinantal and permanental representations of these new polynomial sequences.

Stanley considered Dyck paths where each maximal run of down-steps to the $x$-axis has odd length; they are also enumerated by (shifted) Catalan numbers. Prefixes of these combinatorial objects are enumerated using the kernel method. A more challenging version of skew Dyck paths combined with Stanley’s restriction is also considered.

For $r=1,2,\dots ,6$, we obtain generating functions $F_k^{(r)}(y)$ for words over the alphabet $[k]$, where $y$ tracks the number of parts and $[y^n]$ is the total number of distinct adjacent $r$-tuples in words with $n$ parts. In order to develop these generating functions for $1\le r\le 3$, we make use of intuitive decompositions but for larger values of $r$, we switch to the cluster analysis method for decorated texts that was introduced by Bassino et al. Finally, we account for the coefficients of these generating functions in terms of Stirling set numbers. This is done by putting forward the full triangle of coefficients for all the sub-cases where $r=5$ and 6. This latter is shown to depend on both periodicity and number of letters used in the $r$-tuples.

We consider the following variant of the round-robin scheduling problem: $2n$ people play a number of rounds in which two opposing teams of $n$ players are reassembled in each round. Each two players should play at least once in the same team, and each two players should play at least once in opposing teams. We provide an explicit formula for calculating the minimal numbers of rounds needed to satisfy both conditions. Moreover, we also show how one can construct the corresponding playing schedules.

Two binary structures $\mathfrak{R}$ and ${\mathfrak{R}}^{\prime }$ on the same vertex set $V$ are $(\le k)$-hypomorphic for a positive integer $k$ if, for every set $K$ of at most $k$ vertices, the two binary structures induced by $\mathfrak{R}$ and ${\mathfrak{R}}^{\prime }$ on $K$ are isomorphic. A binary structure $\mathfrak{R}$ is $(\le k)$-reconstructible if every binary
structure ${\mathfrak{R}}^{\prime }$ that is $(\le k)$-hypomorphic to $\mathfrak{R}$ is isomorphic to $\mathfrak{R}$. In this paper, we describe the pairs of $(\le 3)$-hypomorphic posets and the pairs of $(\le 3)$-hypomorphic bichains. As a consequence, we characterize the $(\le 3)$-reconstructible posets and the $(\le 3)$-reconstructible bichains. This answers a question suggested by Y. Boudabbous and C. Delhommé during a personal communication.

A tremendous amount of drug experiments revealed that there exists a strong inherent relation between the molecular structures of drugs and their biomedical and pharmacology characteristics. Due to the effectiveness for pharmaceutical and medical scientists of their ability to grasp the biological and chemical characteristics of new drugs, analysis of the bond incident degree (BID) indices is significant of testing the chemical and pharmacological characteristics of drug molecular structures that can make up the defects of chemical and medicine experiments and can provide the theoretical basis for the manufacturing of drugs in pharmaceutical engineering. Such tricks are widely welcomed in developing areas where enough money is lacked to afford sufficient equipment, relevant chemical reagents, and human resources which are required to investigate the performance and the side effects of existing new drugs. This work is devoted to establishing a general expression for calculating the bond incident degree (BID) indices of the line graphs of various well-known chemical structures in drugs, based on the drug molecular structure analysis and edge dividing technique, which is quite common in drug molecular graphs.

In this paper, we introduce a graph structure, called component intersection graph, on a finite dimensional vector space $\mathbb{V}$. The connectivity, diameter, maximal independent sets, clique number, chromatic number of component intersection graph have been studied.

A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a finite family of subsets on a finite ground set $P$ such that any two subsets of $\mathcal{L}$ share at most one element. Furthermore, if for every two subsets of $\mathcal{L}$ share exactly one element, the linear system is called intersecting. A linear system $(P,\mathcal{L})$ has rank $r$ if the maximum size of any element of $\mathcal{L}$ is $r$. By $\gamma (P,\mathcal{L})$ and ${\nu }_2(P,\mathcal{L})$ we denote the size of the minimum dominating set and the maximum 2-packing of a linear system $(P,\mathcal{L})$, respectively. It is known that any intersecting linear system $(P,\mathcal{L})$ of rank $r$ is such that $\gamma (P,\mathcal{L})\le r-1$. Li et al. in [S. Li, L. Kang, E. Shan and Y. Dong, The finite projective plane and the 5-Uniform linear intersecting hypergraphs with domination number four, Graphs and 34 Combinatorics (2018) , no.~5, 931–945.] proved that every intersecting linear system of rank 5 satisfying $\gamma (P,\mathcal{L})=4$ can be constructed from a 4-uniform intersecting linear subsystem $(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$ of the projective plane of order 3 satisfying $\tau (P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})={\nu }_2(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})=4$, where $\tau (P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$ is the transversal number of $(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$. In this paper, we give an alternative proof of this result given by Li et al., giving a complete characterization of these 4-uniform intersecting linear subsystems. Moreover, we prove a general case, that is, we prove if $q$ is an odd prime power and $(P,\mathcal{L})$ is an intersecting linear system of rank $(q+2)$ satisfying $\gamma (P,\mathcal{L})=q+1$, then this linear system can be constructed from a spanning $(q+1)$-uniform intersecting linear subsystem $(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$ of the projective plane of order $q$ satisfying $\tau (P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})={\nu }_2(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})=q+1$.

We classify all near hexagons of order $(3,t)$ that contain a big quad. We show that, up to isomorphism, there are ten such near hexagons.

Let $G=(V,E)$ be a simple graph. A vertex $v\in V(G)$ ve-dominates every edge $uv$ incident to $v$, as well as every edge adjacent to these incident edges. A set
$D\subseteq V(G)$ is a vertex-edge dominating set if every edge of $E(G)$ is ve-dominated by a vertex of $D.$ The MINIMUM VERTEX-EDGE DOMINATION problem is to find a vertex-edge dominating set of minimum cardinality. A linear time algorithm to find the minimum vertex-edge dominating set for proper interval graphs is proposed. The vertex-edge domination problem is proved to be APX-complete for bounded-free graphs and NP-Complete for Chordal bipartite and Undirected Path graphs.

In this paper, we investigate the $(d,1)$-total labelling of generalized Petersen graphs $P(n,k)$ for $d\ge 3$. We find that the $(d,1)$-total number of $P(n,k)$ with $d\ge 3$ is $d+3$ for even $n$ and odd $k$ or even $n$ and $k=\frac{n}{2}$, and $d+4$ for all other cases.

By employing Kummer and Thomae transformations, we examine four classes of nonterminating ${}_3{F}_2$(1)-series with five integer parameters. Several new summation formulae are established in closed form.

Let $G=(V,E)$ be a simple graph with vertex set $V(G)$ and edge set $E(G)$. The Lanzhou index of a graph $G$ is defined by $Lz(G)=\sum _{u\in V(G)}{d}_u^2{\overline{d}}_u$, where $d_u$ (${\overline{d}}_u$ resp.) denotes the degree of the vertex $u$ in $G$ ($\overline{G}$, the complement graph of $G$ resp.). It has predictive powers to provide insights of chemical relevant properties of chemical graph structures. In this paper we discuss some properties of Lanzhou index. Several inequalities having lower and upper bound for the Lanzhou index in terms of first, second and third Zagreb indices, radius of graph, eccentric connectivity index, Schultz index, inverse sum indeg index and symmetric division deg index, are discussed. At the end the Lanzhou index of corona and join of graphs have been derived.

We define an extremal $(r|\chi )$-graph as an $r$-regular graph with chromatic number $\chi$ of minimum order. We show that the Turán graphs $T_{ak,k}$, the antihole graphs and the graphs $K_k\times K_2$ are extremal in this sense. We also study extremal Cayley $(r|\chi )$-graphs and we exhibit several $(r|\chi )$-graph constructions arising from Turán graphs.

A dominating broadcast of a graph $G$ is a function $f:V(G)\to \{0,1,2,\dots ,\text{diam}(G)\}$ such that $f(v)⩽e(v)$ for all $v\in V(G)$, where $e(v)$ is the eccentricity of $v$, and for every vertex $u\in V(G)$, there exists a vertex $v$ with $f(v)>0$ and $\text{d}(u,v)⩽f(v)$. The cost of $f$ is $\sum _{v\in V(G)}f(v)$. The minimum of costs over all the dominating broadcasts of $G$ is called the broadcast domination number ${\gamma }_b(G)$ of $G$. A graph $G$ is said to be radial if ${\gamma }_b(G)=\text{rad}(G)$. In this article, we give tight upper and lower bounds for the broadcast domination number of the line graph $L(G)$ of $G$, in terms of ${\gamma }_b(G)$, and improve the upper bound of the same for the line graphs of trees. We present a necessary and sufficient condition for radial line graphs of central trees, and exhibit constructions of infinitely many central trees $T$ for which $L(T)$ is radial. We give a characterization for radial line graphs of trees, and show that the line graphs of the $i$-subdivision graph of $K_{1,n}$ and a subclass of caterpillars are radial. Also, we show that ${\gamma }_b(L(C))=\gamma (L(C))$ for any caterpillar $C$.

In this paper we introduce the concept of independent fixed connected geodetic number and investigate its behaviours on some standard graphs. Lower and upper bounds are found for the above number and we characterize the suitable graphs achieving these bounds. We also define two new parameters connected geo-independent number and upper connected geo-independent number of a graph. Few characterization and realization results are formulated for the new parameters. Finally an open problem is posed.

Let $E(H)$ and $V(H)$ denote the edge set and the vertex set of the simple connected graph $H$, respectively. The mixed metric dimension of the graph $H$ is the graph invariant, which is the mixture of two important graph parameters, the edge metric dimension and the metric dimension. In this article, we compute the mixed metric dimension for the two families of the plane graphs viz., the Web graph ${\mathbb{W}}_n$ and the Prism allied graph ${\mathbb{D}}_n^t$. We show that the mixed metric dimension is non-constant unbounded for these two families of the plane graph. Moreover, for the Web graph ${\mathbb{W}}_n$ and the Prism allied graph ${\mathbb{D}}_n^t$, we unveil that the mixed metric basis set $M_G^m$ is independent.

Consider a total labeling $\xi$ of a graph $G$. For every two different edges $e$ and $f$ of $G$, let $wt(e)\ne wt(f)$ where weight of $e=xy$ is defined as $wt(e)=|\xi (e)–\xi (x)–\xi (y)|$. Then $\xi$ is called edge irregular total absolute difference $k$-labeling of $G$. Let $k$ be the minimum integer for which there is a graph $G$ with edge irregular total absolute difference labeling. This $k$ is called the total absolute difference edge irregularity strength of the graph $G$, denoted $tades(G)$. We compute $tades$ of $S{C}_n$, disjoint union of grid and zigzag graph.

A total dominator coloring of $G$ without isolated vertex is a proper coloring of the vertices of $G$ in which each vertex of $G$ is adjacent to every vertex of some color class. The total dominator chromatic number ${\chi }_d^t(G)$ of $G$ is the minimum number of colors among all total dominator coloring of $G$. In this paper, we will give the polynomial time algorithms to computing the total dominator coloring number for $P_4$-reducible and $P_4$-tidy graphs.

An $H$-(a,d)-antimagic labeling in a $H$-decomposable graph $G$ is a bijection $f:V(G)\cup E(G)\to \{1,2,\dots ,p+q\}$ such that $\sum f(H_1),\sum f(H_2),\cdots ,\sum f(H_h)$ forms an arithmetic progression with difference $d$ and first element $a$. $f$ is said to be $H$-$V$-super-$(a,d)$-antimagic if $f(V(G))=\{1,2,\dots ,p\}$. Suppose that $V(G)=U(G)\cup W(G)$ with $|U(G)|=m$ and $|W(G)|=n$. Then $f$ is said to be $H$-$V$-super-strong-$(a,d)$-antimagic labeling if $f(U(G))=\{1,2,\dots ,m\}$ and $f(W(G))=\{m+1,m+2,\dots ,(m+n=p)\}$. A graph that admits a $H$-$V$-super-strong-$(a,d)$-antimagic labeling is called a $H$-$V$-super-strong-$(a,d)$-antimagic decomposable graph. In this paper, we prove that complete bipartite graphs $K_{m,n}$ are $H$-$V$-super-strong-$(a,d)$-antimagic decomposable with both $m$ and $n$ are even.

A Grundy $k$-coloring of a graph $G$ is a proper $k$-coloring of vertices in $G$ using colors $\{1,2,\cdots ,k\}$ such that for any two colors $x$ and $y$, $x<y$, any vertex colored $y$ is adjacent to some vertex colored $x$. The First-Fit or Grundy chromatic number (or simply Grundy number) of a graph $G$, denoted by $\mathrm{\Gamma }\left(G\right)$, is the largest integer $k$, such that there exists a Grundy $k$-coloring for $G$. It can be easily seen that $\mathrm{\Gamma }\left(G\right)$ equals to the maximum number of colors used by the greedy (or First-Fit) coloring of $G$. In this paper, we obtain the Grundy chromatic number of Cartesian Product of path graph, complete graph, cycle graph, complete graph, wheel graph and star graph.

Determining the Tutte polynomial $T(G;x,y)$ of a graph network $G$ is a challenging problem for mathematicians, physicians, and statisticians. This paper investigates a self-similar network model $M(t)$ and derives its Tutte polynomial. In addition, we evaluate exact explicit formulas for the number of acyclic orientations and spanning trees of it as applications of the Tutte polynomial. Finally, we use the derived $T(M(t);x,y)$ to obtain the Tutte polynomial of another self-similar model $N(t)$ presented in [1] and correct the main result discussed in [1] by Ma et al. and test our result numerically by using Matlab.

A vertex-colouring of a graph $\mathrm{\Gamma }$ is rainbow vertex connected if every pair of vertices $(u,v)$ in $\mathrm{\Gamma }$ there is a $u-v$ path whose internal vertices have different colours. The rainbow vertex connection number of a graph $\mathrm{\Gamma }$, is the minimum number of colours needed to make $\mathrm{\Gamma }$ rainbow vertex connected, denoted by $rvc(\mathrm{\Gamma })$. Here, we study the rainbow vertex connection numbers of middle and total graphs. A total-colouring of a graph $\mathrm{\Gamma }$ is total rainbow connected if every pair of vertices $(u,v)$ in $\mathrm{\Gamma }$ there is a $u-v$ path whose edges and internal vertices have different colours. The total rainbow connection number of $\mathrm{\Gamma }$, is the minimum number of colours required to colour the edges and vertices of $\mathrm{\Gamma }$ in order to make $\mathrm{\Gamma }$ total rainbow connected, denoted by $trc(\mathrm{\Gamma })$. In this paper, we also research the total rainbow connection numbers of middle and total graphs.

The harmonic index $H(G)$ of a graph $G$ is defined as the sum of the weights $\frac{2}{d_u+d_v}$ of all edges $uv$ of $G$, where $d_u$ denotes the degree of a vertex $u$. Delorme et al. [1] (2002) put forward a conjecture concerning the minimum Randić index among all connected graphs with $n$ vertices and the minimum degree at least $k$. Motivated by this paper, a conjecture related to the minimum harmonic index among all connected graphs with $n$ vertices and the minimum degree at least $k$ was posed in [2]. In this work, we show that the conjecture is true for a connected graph on $n$ vertices with $k$ vertices of degree $n-1$, and it is also true for a $k$-tree. Moreover, we give a shorter proof of Liu’s result [3].

Let $L$ be a unital ring with characteristic different from $2$ and $\mathcal{O}(L)$ be an algebra of Octonion over $L$. In the present article, our attempt is to present the characterization as well as the matrix representation of some variants of derivations on $\mathcal{O}(L)$. The matrix representation of Lie derivation of $\mathcal{O}(L)$ and its decomposition in terms of Lie derivation and Jordan derivation of $L$ and inner derivation of $\mathcal{O}$ is presented. The result about the decomposition of Lie centralizer of $\mathcal{O}$ in terms of Lie centralizer and Jordan centralizer of $L$ is given. Moreover, the matrix representation of generalized Lie derivation (also known as $D$-Lie derivation) of $\mathcal{O}(L)$ is computed.

A sum divisor cordial labeling of a graph $G$ with vertex set $V(G)$ is a bijection $f$ from $V(G)$ to $\{1,2,\cdots ,|V(G)|\}$ such that an edge $uv$ is assigned the label $1$ if $2$ divides $f(u)+f(v)$ and $0$ otherwise; and the number of edges labeled with $1$ and the number of edges labeled with $0$ differ by at most $1$. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we discuss the sum divisor cordial labeling of transformed tree related graphs.

For a graph $G$ and a positive integer $k$, a royal $k$-edge coloring of $G$ is an assignment of nonempty subsets of the set $\{1,2,\dots ,k\}$ to the edges of $G$ that gives rise to a proper vertex coloring in which the color assigned to each vertex $v$ is the union of the sets of colors of the edges incident with $v$. If the resulting vertex coloring is vertex-distinguishing, then the edge coloring is a strong royal $k$ coloring. The minimum positive integer $k$ for which a graph has a strong royal $k$-coloring is the strong royal index of the graph. The primary emphasis here is on strong royal colorings of trees.

The coloring of all the edges of a graph $G$ with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of $W_n$, $D{W}_n$ and $G_n$ by determining its edge chromatic number.

Let us consider a~simple connected undirected graph $G=(V,E)$. For a~graph $G$ we define a~$k$-labeling $\varphi :V(G)\to \{1,2,\dots ,k\}$ to be a~distance irregular vertex $k$-labeling of the graph $G$ if for every two different vertices $u$ and $v$ of $G$, one has $wt(u)\ne wt(v),$ where the weight of a~vertex $u$ in the labeling $\varphi$ is $wt(u)=\sum _{v\in N(u)}\varphi (v),$ where $N(u)$ is the set of neighbors of $u$. The minimum $k$ for which the graph $G$ has a~distance irregular vertex $k$-labeling is known as distance irregularity strength of $G,$ it is denoted as $dis(G)$. In this paper, we determine the exact value of the distance irregularity strength of corona product of cycle and path with complete graph of order $1,$ friendship graph, Jahangir graph and helm graph. For future research, we suggest some open problems for researchers of the same domain of study.

Elimination ideals are monomial ideals associated to simple graphs, not necessarily square–free, was introduced by Anwar and Khalid. These ideals are Borel type. In this paper, we obtain sharp combinatorial upper bounds of the Castelnuovo–Mumford regularity of elimination ideals corresponding to certain family of graphs.

Let $G$ be a simple connected graph with vertex set $V$ and diameter $d$. An injective function $c:V\to \{1,2,3,\dots \}$ is called a radio labeling of $G$ if $|c(x)c(y)|+d(x,y)\ge d+1$ for all distinct $x,y\in V$, where $d(x,y)$ is the distance between vertices $x$ and $y$. The largest number in the range of $c$ is called the span of the labeling $c$. The radio number of $G$ is the minimum span taken over all radio labelings of $G$. For a fixed vertex $z$ of $G$, the sequence $(l_1,l_2,\dots ,l_r)$ is called the level tuple of $G$, where $l_i$ is the number of vertices whose distance from $z$ is $i$. Let$J^k(l_1,l_2,\dots ,l_r)$ be the wedge sum (i.e. one vertex union) of $k\ge 2$ graphs having same level tuple $(l_1,l_2,\dots ,l_r)$. Let $J(\frac{l_1}{l_1^{\prime }},\frac{l_2}{l_2^{\prime }},\dots ,\frac{l_r}{l_r^{\prime }})$ be the wedge sum of two graphs of same order, having level tuples  $(l_1,l_2,\dots ,l_r)$ and $(l_1^{\prime },l_2^{\prime },\dots ,l_r^{\prime })$. In this paper, we compute the radio number for some sub-families of $J^k(l_1,l_2,\dots ,l_r)$ and $J(\frac{l_1}{l_1^{\prime }},\frac{l_2}{l_2^{\prime }},\dots ,\frac{l_r}{l_r^{\prime }})$.

An antipodal labeling is a function $f$from the vertices of $G$ to the set of natural numbers such that it satisfies the condition $d(u,v)+|f(u)–f(v)|\ge d$, where d is the diameter of $G$and $d(u,v)$ is the shortest distance between every pair of distinct vertices  $u$ and $v$ of $G.$ The span of an antipodal labeling $f$is $sp(f)=max\{|f(u)–f(v)|:u,v\in V(G)\}.$ The antipodal number of~G, denoted by~an(G), is the minimum span of all antipodal labeling of~G. In this paper, we determine the antipodal number of Mongolian tent and Torus grid.