paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary ... complementary super edge magic…
relatively prime. A graph which admits prime labeling is called a prime graph. Graph labeling is an important area of research in Graph theory. There are many kinds of graph ... Prime labeling, and other different…
raised product prime labeling of a graph is the labeling of the vertices with {1,2---,p} and the edges with product of the labels of the incident vertices plus ... each vertex of degree greater than one is one, then the…
graph G by G (p, q) , having p vertices and q edges. Graph, graph labeling, magic labeling, edge magic labeling, vertex magic labeling, 0-edgemagic labeling and 1-edge magic ... such as Pn, Cn (n being odd +ve integer)…
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct edges with twice the value of the terminal vertex ... each vertex of in degree greater than one is one, then the graph…
counting of labeled connected graphs, the question comes into mind first; “How many ways a graph ... labeled?” As there exist certain number of labeled isomorphic graphs. On finding non isomorphic labeled graphs is an…
graph G(V, E) is said to have a vertex prime labeling if its edges can be labeled with distinct integers from1, 2, 3, . . . , E such that for each ... divisor of the labels on its incident edges is 1. A graph that…
𝑥𝑦 the labels assigned to x and y are relatively prime. A graph which admits prime labeling is called a prime graph. In this paper we investigate prime labeling ... some helm related graphs. We also discuss prime…
graceful labeling of G. In this paper the square graceful labeling of the caterpillar S 𝑋1, 𝑋2, … , 𝑋𝑛 , the graphs 𝑃𝑛 −1 1,2, … 𝑛 ,m𝐾1,𝑛 ∪ 𝑠𝐾1,𝑡 , 𝐾1 ... determined. Two new definitions namely, odd square…
alternative approach to handling ASCII characters in the cryptosystems, a vertex magic total labeling of complete graph is thought of in this work. It attempts to enhance the efficiency
This paper deals with radio labeling of planar graphs. We proved that a certain class of planar graphs defined using the complete planner graphs, and a class of planar bipartite ... graphs defined using the complete…
corner- or edge-sharing polyhedra. Periodic nets can be represented by their labelled quotient graphs. This presentation will deal with the trace or projection of building units on labelled quotient ... vertex…
feature as labels in the social networks which are modeled as a graph .Labels in the graph are treated as sensitive or non-sensitive. The background knowledge held ... information that needed to be protected are…
type of each intersection point (graph nodes) and assigning one of two labels to each vessel segment (graph links). Final classification ... vessel segment as A/V is performed through the combination of the graph-based…
classified with Clark using bacterial, viral and fungi database. Taxonomic labels have been recognized to the form of Krona graphs. The whole metagenome sequencing approach allowed the identification of complex
Based on the concept of expansion from contracted graphs, conventional graphs are generated. Conventional graphs with up to three independent loops and eight vertices are tabulated in Tables ... Using this collection, a…
significantly alter key graph properties. In this paper, k-degree-l-diversity anonymity model that considers the protection of structural information as well as sensitive labels of individuals. A novel
might have multiple class labels and class labels are represented in a hierarchical structure—either a tree or a directed acyclic graph (DAG) structure. A more difficult problem than conventional
regular digraphs. We also discuss the importance of labeled digraphs in biological networks. A digraph is said to be regular directed graph, if it satisfies the stronger condition that
consideration the structural information and sensitive labels of individuals as well. Also the study the algorithmic impact of adding noise nodes to original graph and the rigorous analyses
formulated as a labeling problem under a probability maximization framework. To estimate the label configuration, an iterative optimization scheme is proposed to alternately carry out the maximum a posteriori…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.