In this paper the researcher prepares truth table for labeling of Bloom Torus graph by admitting condition Smarandachely product cordial labelling. on is such a with induced

A shell graph is the join of a path P k of 'k' vertices and K 1. A subdivided shell graph can be constructed by subdividing the edges in the path of the shell graph. In this paper we prove that the disjoint union of two subdivided shell graphs is odd graceful and also one modulo three graceful. 1. Introduction A graph labeling is an assignment of integers to the vertices or edges, or both, subj...

A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the...

The 1–2–3 Conjecture asserts that, for every connected graph different from K2, its edges can be labeled with 1,2,3 so when coloring each vertex the sum of incident labels, no two adjacent vertices get same color. This conjecture takes place in more general context distinguishing labelings, where goal is to label graphs that some pairs their elements are distinguishable relatively parameter com...

A Smarandache-Fibonacci triple is a sequence S(n), n ≥ 0 such that S(n) = S(n − 1) + S(n − 2), where S(n) is the Smarandache function for integers n ≥ 0. Clearly, it is a generalization of Fibonacci sequence and Lucas sequence. Let G be a (p, q)-graph and {S(n)|n ≥ 0} a Smarandache-Fibonacci triple. An bijection f : V (G) → {S(0), S(1), S(2), . . . , S(q)} is said to be a super Smarandache-Fibo...

Let [n]∗ denote the set of integers {−n−1 2 , . . . , n−1 2 } if n is odd, and {−n 2 , . . . , n 2 } \ {0} if n is even. A super edge-graceful labeling f of a graph G of order p and size q is a bijection f : E(G) → [q]∗, such that the induced vertex labeling f ∗ given by f ∗(u) = ∑ uv E(G) f(uv) is a bijection f ∗ : V (G) → [p]∗. A graph is super edge-graceful if it has a super edge-graceful la...

A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...

Indices and data structures for web querying have mostly considered tree shaped data, reflecting the view of XML documents as tree-shaped. However, for RDF (and when querying ID/IDREF constraints in XML) data is indisputably graph-shaped. In this chapter, we first study existing indexing and labeling schemes for RDF and graph data in general with focus on support for efficient adjacency and rea...

For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...

In this paper we discuss cordial labeling in the context of arbitrary supersubdivision of graph. We prove that the graphs obtained by arbitrary supersubdivision of path as well as star admit cordial labeling. In addition to this we prove that the graph obtained by arbitrary supersubdivision of cycle is cordial except when n and all mi are simultaneously odd numbers. Mathematics Subject Classifi...