Tribonacci Cordial Labeling of Some Snake Graphs

The product cordial labeling is a variant of cordial labeling. Here we investigate product cordial labelings for alternate triangular snake and alternate quadrilateral snake graphs.

The quantitative specifications which are used to narrate the atomic topology of graphs are usually entitled as topological indices in theoretical Chemistry. The features of physical and chemical properties like melting point, entropy, boiling point, energy generation and enthalpy of vaporization of chemical compounds can be estimated by means of these topological indices. The field of Graph theory has a remarkable application of linking certain graphs with many types of topological indices. In this paper we compute first and second Zagreb indices, Randi´c index, sum-connectivity index, harmonic index, inverse sum indeg index, modified first and second Zagreb indices and first and second hyper Zagreb indices of Triangular snake graph and alternate Triangular snake graph.

One important problem in graph theory is graph coloring or graph labeling.Labeling problem is a well-studied problem due to its wide applications, especially in frequency assignment in(mobile) communication systems, coding theory, x-ray crystallography, radar, circuit design, etc.For two non-negative integers, labeling of a graph is a function from the node set to the set of non-negative integers.For any two distinct vertices and of , a radio labeling is an injective function : 0 such that , | | 1 where is the diameter of .The radio number of , is the maximum value of taken overall radio labelings of .This paper determines the radio number of double triangular snake graphs.

This research focuses on a detailed investigation of advanced fuzzy indices applied to enhanced version of triangular snake graph, designated as fuzzy triangular snake graph (mathcal {FTS}_{mathbb {N}}). Its practical applications in wireless sensor network (WSN) is also designed. We derive closed-form formulas for several fuzzy indices, including first and second fuzzy Zagreb indices, fuzzy Harmonic, Randić, Misbalance Prodeg, Nirmala, along with Sombor indices. By applying these indices to a WSN modeled with redundant triangular connectivity, we evaluate the network’s structural efficiency, robustness, and fault tolerance. The computed results reveal that the fuzzy triangular snake topology ensures balanced node connectivity, minimizes energy imbalance, and enhances the network’s ability to maintain reliable communication in the presence of node failures and uncertainties. The results confirm the applicability of the fuzzy triangular snake model in optimization of energy- and resilient WSNs, thus drawing a high degree of correlation between such contemporary graph theory, as fuzziness, and the design of a modern communication network.

Let G = (V,E) be a simple graph. L(2, 1)−labeling defined as a functionf : V (G) → N0 such that, x and y are two adjacent vertices in V, then if x andy are adjacent to each other, |f(y) − f(x)| ≥ 2 and if x and y have the distance 2,|f(y) − f(x)| ≥ 1. The L(2, 1)-labeling number of G, called λ2,1(G), is the smallestnumbermof G. In this paper, we will further discuss the L(2, 1)-labeling of mongoliantent, lobster, triangular snake, and kayak paddle.Keywords: L(2,1)-Labeling, mongolian tent, lobster, triangular snake, kayak paddle.

kth Fibonacci Prime Labeling is defined as labeling the vertices of a graph with distinct Fibonacci numbers starting since the kth Fibonacci term sustaining the condition that the , where and are labels of any adjacent vertices u and v. Graphs formed by consecutively connecting identical base graphs, linearly or in alternating pattern, is called Snake graph. In this paper, we show that some snake graphs admit kth Fibonacci prime labeling.

An edge odd graceful labeling of graph G with q number of edges is a bijection f : E(G) → {1,3,5, …,2q - 1} so that induced mapping f+ : V(G) → {0, 1,2, … ,2q - 1} given by f+(x) = ExyEE(G) f(xy) (mod 2q) is injective. A triangular snake net graph (m - 1)C3m is graph obtained from a path u1 u2 u3 … um + 1 by joining every ui and ui + 1 to a new vertex vi with 1 ≤ i ≤ m and joining every vi to vi+1 with 1 ≤ i ≤ m - 1. A quadrilateral snake net graph C4,4m is a graph obtained from vertices u1, u2, u3, …, u2m + 1 by joining every ui and ui + 1 to two vertices vi and v2i-1with 1 ≤ i ≤ 2m, and joining every v4i - 2 and v4i to a new vertex w2i and joining every v4i - 3 and v4i-1 to a new vertex w2i - 1 with 1 ≤ i ≤ m. An alternate quadrilateral snake net A(C4,4m) is graph obtained from vertices u1, u2, u3, … , u3m by joining every u3i and u3i + 1 with 1 ≤ i ≤ m - 1, and joining u3i - 2 and u3i - 1 to two new vertices v4i-3 and v4i-2, joining u3i-1 and u3i to two new vertices v4i-1 and v4i, joining v4i-3 and v4i-1 to a new vertex w2i-1, and joining v4i-2 and v4i to two a new vertex w2i with 1 ≤ i ≤ m. A quadrilateral pleated snake graph C42 is a graph obtained from vertices u0, u, and v by joining every u0 and u to new vertices ui and joining every u0 and v to new vertices vi with 1 ≤ i ≤ 2 m + 2. In this paper, we study edge odd graceful labeling for the following families of snake graphs such as triangular snake net, quadrilateral snake net, alternate quadrilateral snake net, and quadrilateral pleated snake.

Sholairaju and Chithra introduced a graph which admits an edge odd graceful labeling called an edge odd graceful graph. An edge odd graceful labeling of a graph G on q edges is a bijection f : E(G) → {1,3,5, …, 2q-1} so that the induced mapping f+: V(G) → {0,1,2, …,2q - 1} given by f+(x) = Σxy∈E(G) f(xy) (mod 2q) is injective. A triangular snake C3m is a graph obtained from a path u1u2u3 … um+1 by joining every ui and ui+1 to a new vertex vi. A quadrilateral snake C4m is a graph obtained from vertices u1, u2, u3, …, um+1 by joining every ui and ui+1 to two vertices vi and wi. In this pa r we study edge odd graceful labelings of triangular snake C3m and quadrilateral snake C4m. We find a labeling of C3m and a labeling of C4m. This implies that graphs C3m and C4m are odd graceful, and we have new classes of graphs that are odd graceful.

The computational complexity of cordial and equitable labelling

In graph theory many useful mathematical disciplines, but the extremely useful one is graph labeling. A graph labeling is used in many applications in various fields like X-ray crystallography, computer science, data base management, coding theory, astronomy and physics. A labeling of edges and vertices of a simple graph G(V, E) by a mapping ¥ : V(G) ∪ E(G) → {1, 2, 3, … , ℜ} provided that any two different edges have distinct weights is called an edge irregular total ℜ -labeling. If ℜ is minimum and G admits an edge irregular total ℜ-labeling, then it is called the total edge irregularity strength (TEIS) denoted by tes(G). In this paper, we have introduced three definitions: the quintet snake graph QS n , the double quintet snake graph D(QS n) and the m–multiple quintet snake graph M(QS n). Moreover, the exact value of TEIS for the new graphs are investigated.

A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake, double alternate quadrilateral snake.

A Triangular snake Tn is obtained from a path u1u2 …un by joining ui and ui+1 to a new vertex wi for 1≤i≤n−1. A Central graph of Triangular snake C(Tn) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn. In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.

Graph labeling is the term used to describe the procedure of giving unique identifiers. Graph attributing is a method for modeling real-world problems in industries such as circuit design, surveillance technology, and telecommunications networks. A graph is characterized as possessing cubic roots cordial labeling if each node is designated with either the value 1, δ or δ2 or another specified integer. The derived set containing the value 1 or another integer, the mathematical conditions η (k) − η (w)| ≤ 1 and | ξ (k) − ξ (w)| ≤ 1, k ≠ w and k, w ∈ {1, δ, δ2} where η (k) and ξ (k) are represents the aggregated vertices and edges assigned in k ∈ {1, δ, δ2}. Labeled graphs prove to be immensely beneficial across a variety of mathematical frameworks, including domains such as cyber security and radar code formulation. The application of cordial labeling has been demonstrated to provide significant advantages in the context of signal processing channels and challenges associated with specific code word design. The idea of cubic roots cordial labeling has attracted a lot of academic attention among various labeling techniques, unique structural characteristics and capacity to depict a fair flow of information within linked networks. The investigation of the behavior of cubic roots cordial labeling in relation to graph operations is currently receiving extensive scholarly examination, particularly concerning path graphs, despite its critical relevance. This paper explore the cordial labeling of cubic product graphs generated from the combination of two path graphs. The four fundamental graph operations on which we particularly focus on activities, we analyze the specific conditions to possess cubic roots cordial labeling.

The process of assigning the binary numbers 0 and 1 to the edges of a graph \(G = (V, E)\) through evaluating functions defined on the vertex set V and the edge set E of G using the concepts of prime and Narayana numbers by satisfying cordiality on the edges. This process on the graph G is known as Narayana prime cordial labeling of G and this graph G is called Narayana prime cordial graph. In this article, we compute the Narayana prime cordial labeling of Web graphs and Flower graphs.

Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate the 3-difference cordial labeling of wheel, helms, flower graph, sunflower graph, lotus inside a circle, closed helm, and double wheel.