Let \(G_k, (k ≥ 0)\) be the family of graphs that have exactly k cycles. For \(0 ≤ k ≤ 3\), we compute the Hadwiger number for graphs in \(G_k\) and further deduce that the Hadwiger Conjecture is true for such families of graphs.

Split domination number of a graph is the cardinality of a minimum dominating set whose removal disconnects the graph. In this paper, we define a special family of Halin graphs and determine the split domination number of those graphs. We show that the construction yield non-isomorphic families of Halin graphs but with same split domination numbers.

A graph \(G(v,E)\) with \(n\) vertices is said to have modular multiplicative divisor bijection \(f: V(G)→{1,2,.., n}\) and the induced function \(f*: E(G) → {0,1,2,…, n – 1}\) where \(f*(uv)=f(u)f(v)(mod\,\,n)\) for all \(uv \in E(G)\) such that \(n\) divides the sum of all edge labels of \(G\). This paper studies MMD labeling of an even arbitrary supersubdivision (EASS) of corona related graphs.

In this paper, the distance and degree based topological indices for double silicate chain graph are obtained.

In this paper, we introduce a new form of fuzzy number named as Icosikaitetragonal fuzzy number with its membership function. It includes some basic arithmetic operations like addition, subtraction, multiplication and scalar multiplication by means of \(\alpha\)-cut with numerical illustrations.

In this paper, we determine the wirelength of embedding complete bipartite graphs \(K_{2^{n-1}, 2^{n-1}}\) into 1-rooted sibling tree \(ST_n^1\), and Cartesian product of 1-rooted sibling trees and paths.

A dominator coloring is a proper vertex coloring of a graph \(G\) such that each vertex is adjacent to all the vertices of at least one color class or either alone in its color class. The minimum cardinality among all dominator coloring of \(G\) is a dominator chromatic number of \(G\), denoted by \(X_d(G)\). On removal of a vertex the dominator chromatic number may increase or decrease or remain unaltered. In this paper, we have characterized nontrivial trees for which dominator chromatic number is stable.

If every induced sub graph \(H\) of a graph \(G\) contains a minimal dominating set that intersects every maximal cliques of \(H\), then \(G\) is SSP (super strongly perfect). This paper presents a cyclic structure of some circulant graphs and later investigates their SSP properties, while also giving attention to find the SSP parameters like colourability, cardinality of minimal dominating set and number of maximal cliques of circulant graphs.

A set \(S\) of vertices in a graph \(G\) is said to be a dominating set if every vertex in \(V(G)\S\) is adjacent to some vertex in \(S\). A dominating set \(S\) is called a total dominating set if each vertex of \(V(G)\) is adjacent to some vertex in \(S\). Molecules arranging themselves into predictable patterns on silicon chips could lead to microprocessors with much smaller circuit elements. Mathematically, assembling in predictable patterns is equivalent to packing in graphs. In this pa-per, we determine the total domination number for certain nanotori using packing as a tool.

Among the varius coloring of graphs, the concept of equitable total coloring of graph \(G\) is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is called its equitable total chromatic number. In this paper, we obtained an equitable total chromatic number of middle graph of path, middle graph of cycle, total graph of path and total graph of cycle.