In [1] Abdel-Aal has introduced the notions of m-shadow graphs and n-splitting graphs, for all m, n ≥ 1.
In this paper, we prove that, the m-shadow graphs for paths and complete bipartite graphs are odd
harmonious graphs for all m ≥ 1. Also, we prove the n-splitting graphs for paths, stars and symmetric
product between paths and null graphs are odd harmonious graphs for all n≥ 1. In addition, we present
some examples to illustrate the proposed theories. Moreover, we show that some families of graphs admit
odd harmonious libeling.
The document introduces new classes of odd graceful graphs called m-shadow graphs and m-splitting graphs. It proves that m-shadow graphs of paths, complete bipartite graphs, and symmetric products of paths and null graphs are odd graceful. It also proves that m-splitting graphs of paths, stars, and symmetric products of paths and null graphs are odd graceful. Examples are provided to illustrate the theories.
A labeling of graph G is a mapping that carries a set of graph elements into a set of numbers (Usually positive integers) called labels. An edge magic labeling on a graph with p vertices and q edges will be defined as a one-to-one map taking the vertices and edges onto the integers 1,2,----,
p+q with the property that the sum of the label on an edge and the labels of its end vertices is constant independent of the choice of edge.
DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHSgraphhoc
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with
max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple
graph are discussed.
The document discusses characteristics of (γ, 3)-critical graphs. It begins by providing examples of (γ, 3)-critical graphs, such as the circulant graph C12 1, 4 and the Cartesian product Kt Kt . It then shows that a (γ, k)-critical graph is not necessarily (γ, k′)-critical for k ≠ k′ between 1 and 3. The document also verifies properties of (γ, 3)-critical graphs, such as not having vertices of degree 3. It concludes by proving characteristics about (γ, 3)-critical graphs that are paths, including that they have no vertices in V+ and satisfy other properties.
Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in GraphsIJERA Editor
In this paper we study about x-geodominating set, geodetic set, geo-set, geo-number of a graph G. We study the
binary operation, link vectors and some required results to develop algorithms. First we design two algorithms
to check whether given set is an x-geodominating set and to find the minimum x-geodominating set of a graph.
Finally we present another two algorithms to check whether a given vertex is geo-vertex or not and to find the
geo-number of a graph.
In [8] Liang and Bai have shown that the - 4 kC snake graph is an odd harmonious graph for each k ³ 1.
In this paper we generalize this result on cycles by showing that the - n kC snake with string 1,1,…,1 when
n º 0 (mod 4) are odd harmonious graph. Also we show that the - 4 kC snake with m-pendant edges for
each k,m ³ 1 , (for linear case and for general case). Moreover, we show that, all subdivision of 2 k mD -
snake are odd harmonious for each k,m ³ 1 . Finally we present some examples to illustrate the proposed
theories.
E-Cordial Labeling of Some Mirror GraphsWaqas Tariq
Let G be a bipartite graph with a partite sets V1 and V2 and G\' be the copy of G with corresponding partite sets V1\' and V2\' . The mirror graph M(G) of G is obtained from G and G\' by joining each vertex of V2 to its corresponding vertex in V2\' by an edge. Here we investigate E-cordial labeling of some mirror graphs. We prove that the mirror graphs of even cycle Cn, even path Pn and hypercube Qk are E-cordial graphs.
The document discusses claw decompositions of product graphs. It provides necessary and sufficient conditions for decomposing the Cartesian product of standard graphs into claws. Some key results are:
1. If G1 and G2 are claw decomposable, then their Cartesian product G1 x G2 is also claw decomposable.
2. The Cartesian product of complete graphs or complete bipartite graphs is claw decomposable if certain conditions on their vertex sets are met.
3. Sufficient conditions are given for the lexicographic product of a graph G with Km, Kn, or K2 x Kn to be claw decomposable when m and n satisfy certain properties.
So in summary, the document
The document introduces new classes of odd graceful graphs called m-shadow graphs and m-splitting graphs. It proves that m-shadow graphs of paths, complete bipartite graphs, and symmetric products of paths and null graphs are odd graceful. It also proves that m-splitting graphs of paths, stars, and symmetric products of paths and null graphs are odd graceful. Examples are provided to illustrate the theories.
A labeling of graph G is a mapping that carries a set of graph elements into a set of numbers (Usually positive integers) called labels. An edge magic labeling on a graph with p vertices and q edges will be defined as a one-to-one map taking the vertices and edges onto the integers 1,2,----,
p+q with the property that the sum of the label on an edge and the labels of its end vertices is constant independent of the choice of edge.
DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHSgraphhoc
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with
max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple
graph are discussed.
The document discusses characteristics of (γ, 3)-critical graphs. It begins by providing examples of (γ, 3)-critical graphs, such as the circulant graph C12 1, 4 and the Cartesian product Kt Kt . It then shows that a (γ, k)-critical graph is not necessarily (γ, k′)-critical for k ≠ k′ between 1 and 3. The document also verifies properties of (γ, 3)-critical graphs, such as not having vertices of degree 3. It concludes by proving characteristics about (γ, 3)-critical graphs that are paths, including that they have no vertices in V+ and satisfy other properties.
Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in GraphsIJERA Editor
In this paper we study about x-geodominating set, geodetic set, geo-set, geo-number of a graph G. We study the
binary operation, link vectors and some required results to develop algorithms. First we design two algorithms
to check whether given set is an x-geodominating set and to find the minimum x-geodominating set of a graph.
Finally we present another two algorithms to check whether a given vertex is geo-vertex or not and to find the
geo-number of a graph.
In [8] Liang and Bai have shown that the - 4 kC snake graph is an odd harmonious graph for each k ³ 1.
In this paper we generalize this result on cycles by showing that the - n kC snake with string 1,1,…,1 when
n º 0 (mod 4) are odd harmonious graph. Also we show that the - 4 kC snake with m-pendant edges for
each k,m ³ 1 , (for linear case and for general case). Moreover, we show that, all subdivision of 2 k mD -
snake are odd harmonious for each k,m ³ 1 . Finally we present some examples to illustrate the proposed
theories.
E-Cordial Labeling of Some Mirror GraphsWaqas Tariq
Let G be a bipartite graph with a partite sets V1 and V2 and G\' be the copy of G with corresponding partite sets V1\' and V2\' . The mirror graph M(G) of G is obtained from G and G\' by joining each vertex of V2 to its corresponding vertex in V2\' by an edge. Here we investigate E-cordial labeling of some mirror graphs. We prove that the mirror graphs of even cycle Cn, even path Pn and hypercube Qk are E-cordial graphs.
The document discusses claw decompositions of product graphs. It provides necessary and sufficient conditions for decomposing the Cartesian product of standard graphs into claws. Some key results are:
1. If G1 and G2 are claw decomposable, then their Cartesian product G1 x G2 is also claw decomposable.
2. The Cartesian product of complete graphs or complete bipartite graphs is claw decomposable if certain conditions on their vertex sets are met.
3. Sufficient conditions are given for the lexicographic product of a graph G with Km, Kn, or K2 x Kn to be claw decomposable when m and n satisfy certain properties.
So in summary, the document
function f is said to be an even harmonious labeling of a graph G with q edges if f is an injection from the vertices of G to the integers from 0 to 2q and the induced function f* from the edges ofG to {0, 2…….….2(q-1)} defined by f* (uv) = f (u) +f (v) (mod 2q) is bijective. The graph G is said to have an even harmonious labeling. In this paper the even harmonious labeling of a class of graph namely H (2n, 2t+1) is established.
Group {1, −1, i, −i} Cordial Labeling of Product Related GraphsIJASRD Journal
Let G be a (p,q) graph and A be a group. Let f : V (G) → A be a function. The order of u ∈ A is the least positive integer n such that un = e. We denote the order of u by o(u). For each edge uv assign the label 1 if (o(u), o(v)) = 1 or 0 otherwise. f is called a group A Cordial labeling if |vf (a) − vf (b)| ≤ 1 and |ef (0) − ef (1)| ≤ 1, where vf (x) and ef (n) respectively denote the number of vertices labeled with an element x and number of edges labeled with n(n = 0, 1). A graph which admits a group A Cordial labeling is called a group A Cordial graph. In this paper we define group {1,−1, i,−i} Cordial graphs and prove that Hypercube Qn = Qn−1 × K2, Book Bn = Sn × K2, n-sided prism Prn = Cn × K2 and Pn × K3 are all group {1,−1, i,−i} Cordial for all n.
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric G X × X × X ® R+ d : where X = r(v /W) =
{(d(v,v1),d(v,v2 ),...,d(v,v ) / v V (G))} k Î , denoted d G and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if d G
numbers of pendant edges are added to the non-basis vertices.
LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFULFransiskeran
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless
communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder
graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also
show that the subdivision of ladder graph Ln with m-pendant S(Ln) mk1 is odd graceful. Finally, we
prove that all the subdivision of triangular snakes ( k snake ) with pendant edges
1
( ) k S snake mk are odd graceful.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESgraphhoc
This document summarizes research on calculating the Grundy number of fat-extended P4-laden graphs. It begins by introducing the Grundy number and discussing that it is NP-complete to calculate for general graphs. It then presents previous work that has found polynomial time algorithms to calculate the Grundy number for certain graph classes. The main results are that the document proves that the Grundy number can be calculated in polynomial time, specifically O(n3) time, for fat-extended P4-laden graphs by traversing their modular decomposition tree. This implies the Grundy number can also be calculated efficiently for several related graph classes that are contained within fat-extended P4-laden graphs.
The degree equitable connected cototal dominating graph 퐷푐 푒 (퐺) of a graph 퐺 = (푉, 퐸) is a graph with 푉 퐷푐 푒 퐺 = 푉(퐺) ∪ 퐹, where F is the set of all minimal degree equitable connected cototal dominating sets of G and with two vertices 푢, 푣 ∈ 푉(퐷푐 푒 (퐺)) are adjacent if 푢 = 푣 푎푛푑 푣 = 퐷푐 푒 is a minimal degree equitable connected dominating set of G containing u. In this paper we introduce this new graph valued function and obtained some results
The document summarizes a two-stage image segmentation method and super pixels. It discusses a two-stage convex image segmentation method that transforms an image into a piecewise smooth one that can be segmented based on pixel values. It introduces super pixels, which group pixels into perceptually meaningful atomic regions. The document studied these methods through MATLAB and also explored applications like saliency detection based on super pixel segmentation. It focused on understanding the algorithms through code implementation and improving the efficiency of methods like the SLIC super pixel algorithm.
The document presents an algorithm to find an optimal L(2,1)-labeling for triangular windmill graphs. It begins with definitions of triangular windmill graphs, L(2,1)-labelings, and the Chang-Kuo algorithm. The Chang-Kuo algorithm is then applied to obtain an L(2,1)-labeling of a triangular windmill graph W(3,n) by iteratively finding and labeling maximal 2-stable sets. The maximum label used is the labeling number λ(G).
Fractional integration and fractional differentiation of the product of m ser...Alexander Decker
This document presents theorems on fractional integrals and derivatives of the product of an M-series and H-function. An M-series is a special case of an H-function, and represents important functions in physics and applied sciences. Theorems are derived for the Riemann-Liouville fractional integral and derivative of the product. Additional theorems provide formulas for fractional integrals of the M-series alone, defined using an H-function operator previously established by Saxena and Khumbhat. The theorems extend previous work and provide new formulas incorporating these important special functions.
Applications and Properties of Unique Coloring of GraphsIJERA Editor
This paper studies the concepts of origin of uniquely colorable graphs, general results about unique vertex colorings, assorted results about uniquely colorable graphs, complexity results for unique coloring Mathematics Subject Classification 2000: 05CXX, 05C15, 05C20, 37E25.
Fixed point result in menger space with ea propertyAlexander Decker
This document presents a fixed point theorem for four self-maps in a Menger space. It begins by defining key concepts related to Menger spaces including probabilistic metric spaces, t-norms, neighborhoods, convergence, Cauchy sequences, and completeness. It then introduces properties like weakly compatible maps, property (EA), and JSR mappings. The main result, Theorem 3.1, proves the existence of a common fixed point for four self-maps under conditions that the map pairs satisfy a common property (EA) and are closed, JSR mappings satisfying an inequality involving the probabilistic distance functions.
Density theorems for Euclidean point configurationsVjekoslavKovac1
1. The document discusses density theorems for point configurations in Euclidean space. Density theorems study when a measurable set A contained in Euclidean space can be considered "large".
2. One classical result is that for any measurable set A contained in R2 with positive upper Banach density, there exist points in A whose distance is any sufficiently large real number. This has been generalized to higher dimensions and other point configurations.
3. Open questions remain about determining all point configurations P for which one can show that a sufficiently large measurable set A contained in high dimensional Euclidean space must contain a scaled copy of P.
The document discusses using the renormalization group to build a "tower" of connected field theories across dimensions, starting from known 2-dimensional conformal field theories. It focuses on analyzing the O(N) x O(m) Landau-Ginzburg-Wilson model in 6 dimensions, which is connected to the 4D theory through a Wilson-Fisher fixed point. Perturbative calculations and the large N expansion are used to calculate critical exponents and check that the theories are in the same universality class. Studying higher dimensional theories could provide insight into physics beyond the Standard Model.
On maximal and variational Fourier restrictionVjekoslavKovac1
Workshop talk slides, Follow-up workshop to trimester program "Harmonic Analysis and Partial Differential Equations", Hausdorff Institute, Bonn, May 2019.
This document introduces the concept of weak triple connected domination number (γwtc) of a graph. A subset S of vertices is a weak triple connected dominating set if S is a weak dominating set and the induced subgraph <S> is triple connected. The γwtc is defined as the minimum cardinality of such a set. Some standard graphs are used to illustrate the concept and determine this number. Bounds on γwtc are obtained for general graphs, and its relationship to other graph parameters are investigated. The paper aims to develop this new graph invariant and establish basic results about weak triple connected domination.
A function f is called a graceful labelling of a graph G with q edges if f is an injection
from the vertices of G to the set {0, 1, 2, . . . , q} such that, when each edge xy is assigned the
label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo
N graceful (where N is a positive integer) if there is a function φ from the vertex set of G to
{0, 1,N, (N + 1), 2N, (2N + 1), . . . ,N(q − 1),N(q − 1) + 1} in such a way that (i) φ is 1 − 1 (ii)
φ induces a bijection φ_ from the edge set of G to {1,N + 1, 2N + 1, . . . ,N(q − 1) + 1} where
φ_(uv)=|φ(u) − φ(v)| . In this paper we prove that the every regular bamboo tree and coconut tree
are one modulo N graceful for all positive integers N .
Tales on two commuting transformations or flowsVjekoslavKovac1
1) The document summarizes recent work on ergodic averages and flows for commuting transformations. It discusses convergence results for single and double linear ergodic averages in L2 and almost everywhere, as well as providing norm estimates to quantify the rate of convergence.
2) It also considers double polynomial ergodic averages and provides proofs for almost everywhere convergence in the continuous-time setting. Open problems remain for the discrete-time case.
3) An ergodic-martingale paraproduct is introduced, motivated by an open question from 1950. Convergence in Lp norm is shown, while almost everywhere convergence remains open.
New Classes of Odd Graceful Graphs - M. E. Abdel-AalGiselleginaGloria
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. We
prove that, the m-shadow graphs for paths, complete bipartite graphs and symmetric product between
paths and null graphs are odd graceful. In addition, we show that, the m-splitting graphs for paths, stars
and symmetric product between paths and null graphs are odd graceful. Finally, we present some examples
to illustrate the proposed theories.
The document is an academic paper that discusses odd harmonious labelings of cyclic snake graphs. It contains the following key points:
1) It generalizes previous results by showing that the -nkC snake graph with a string of all 1s is odd harmonious when n is congruent to 0 modulo 4.
2) It proves that the -4kC snake graph with m pendant edges attached to each vertex, for m ≥ k, is odd harmonious for both the linear and general cases.
3) It shows that all subdivisions of the 2kmΔ snake graph are odd harmonious for m ≥ k. Examples are provided to illustrate the theories.
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent to 0 or 2 (mod 4), and we found a counter example for the inverse of this statement is not true. We also proved that, the graphs which are constructed by two copies of even cycle Cn sharing a common edge are odd harmonious. In addition, we obtained an odd harmonious labeling for the graphs which are constructed by two copies of cycle Cn sharing a common vertex when n is congruent to 0 (mod 4). Moreover, we show that, the Cartesian product of cycle graph Cm and path Pn for each n ≥ 2, m ≡ 0 (mod 4) are odd harmonious graphs. Finally many new families of odd harmonious graphs are introduced.
On the Odd Gracefulness of Cyclic Snakes With Pendant EdgesGiselleginaGloria
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs. In particular we show an odd graceful labeling of the linear 4 1 kC snake mK − e and therefore we introduce the odd graceful labeling of 4 1 kC snake mK − e ( for the general case ). We prove that the subdivision of linear 3 kC snake − is odd graceful. We also prove that the subdivision of linear 3 kC snake − with m-pendant edges is odd graceful. Finally, we present an odd graceful labeling of the crown graph P mK n 1 e .
function f is said to be an even harmonious labeling of a graph G with q edges if f is an injection from the vertices of G to the integers from 0 to 2q and the induced function f* from the edges ofG to {0, 2…….….2(q-1)} defined by f* (uv) = f (u) +f (v) (mod 2q) is bijective. The graph G is said to have an even harmonious labeling. In this paper the even harmonious labeling of a class of graph namely H (2n, 2t+1) is established.
Group {1, −1, i, −i} Cordial Labeling of Product Related GraphsIJASRD Journal
Let G be a (p,q) graph and A be a group. Let f : V (G) → A be a function. The order of u ∈ A is the least positive integer n such that un = e. We denote the order of u by o(u). For each edge uv assign the label 1 if (o(u), o(v)) = 1 or 0 otherwise. f is called a group A Cordial labeling if |vf (a) − vf (b)| ≤ 1 and |ef (0) − ef (1)| ≤ 1, where vf (x) and ef (n) respectively denote the number of vertices labeled with an element x and number of edges labeled with n(n = 0, 1). A graph which admits a group A Cordial labeling is called a group A Cordial graph. In this paper we define group {1,−1, i,−i} Cordial graphs and prove that Hypercube Qn = Qn−1 × K2, Book Bn = Sn × K2, n-sided prism Prn = Cn × K2 and Pn × K3 are all group {1,−1, i,−i} Cordial for all n.
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric G X × X × X ® R+ d : where X = r(v /W) =
{(d(v,v1),d(v,v2 ),...,d(v,v ) / v V (G))} k Î , denoted d G and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if d G
numbers of pendant edges are added to the non-basis vertices.
LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFULFransiskeran
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless
communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder
graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also
show that the subdivision of ladder graph Ln with m-pendant S(Ln) mk1 is odd graceful. Finally, we
prove that all the subdivision of triangular snakes ( k snake ) with pendant edges
1
( ) k S snake mk are odd graceful.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESgraphhoc
This document summarizes research on calculating the Grundy number of fat-extended P4-laden graphs. It begins by introducing the Grundy number and discussing that it is NP-complete to calculate for general graphs. It then presents previous work that has found polynomial time algorithms to calculate the Grundy number for certain graph classes. The main results are that the document proves that the Grundy number can be calculated in polynomial time, specifically O(n3) time, for fat-extended P4-laden graphs by traversing their modular decomposition tree. This implies the Grundy number can also be calculated efficiently for several related graph classes that are contained within fat-extended P4-laden graphs.
The degree equitable connected cototal dominating graph 퐷푐 푒 (퐺) of a graph 퐺 = (푉, 퐸) is a graph with 푉 퐷푐 푒 퐺 = 푉(퐺) ∪ 퐹, where F is the set of all minimal degree equitable connected cototal dominating sets of G and with two vertices 푢, 푣 ∈ 푉(퐷푐 푒 (퐺)) are adjacent if 푢 = 푣 푎푛푑 푣 = 퐷푐 푒 is a minimal degree equitable connected dominating set of G containing u. In this paper we introduce this new graph valued function and obtained some results
The document summarizes a two-stage image segmentation method and super pixels. It discusses a two-stage convex image segmentation method that transforms an image into a piecewise smooth one that can be segmented based on pixel values. It introduces super pixels, which group pixels into perceptually meaningful atomic regions. The document studied these methods through MATLAB and also explored applications like saliency detection based on super pixel segmentation. It focused on understanding the algorithms through code implementation and improving the efficiency of methods like the SLIC super pixel algorithm.
The document presents an algorithm to find an optimal L(2,1)-labeling for triangular windmill graphs. It begins with definitions of triangular windmill graphs, L(2,1)-labelings, and the Chang-Kuo algorithm. The Chang-Kuo algorithm is then applied to obtain an L(2,1)-labeling of a triangular windmill graph W(3,n) by iteratively finding and labeling maximal 2-stable sets. The maximum label used is the labeling number λ(G).
Fractional integration and fractional differentiation of the product of m ser...Alexander Decker
This document presents theorems on fractional integrals and derivatives of the product of an M-series and H-function. An M-series is a special case of an H-function, and represents important functions in physics and applied sciences. Theorems are derived for the Riemann-Liouville fractional integral and derivative of the product. Additional theorems provide formulas for fractional integrals of the M-series alone, defined using an H-function operator previously established by Saxena and Khumbhat. The theorems extend previous work and provide new formulas incorporating these important special functions.
Applications and Properties of Unique Coloring of GraphsIJERA Editor
This paper studies the concepts of origin of uniquely colorable graphs, general results about unique vertex colorings, assorted results about uniquely colorable graphs, complexity results for unique coloring Mathematics Subject Classification 2000: 05CXX, 05C15, 05C20, 37E25.
Fixed point result in menger space with ea propertyAlexander Decker
This document presents a fixed point theorem for four self-maps in a Menger space. It begins by defining key concepts related to Menger spaces including probabilistic metric spaces, t-norms, neighborhoods, convergence, Cauchy sequences, and completeness. It then introduces properties like weakly compatible maps, property (EA), and JSR mappings. The main result, Theorem 3.1, proves the existence of a common fixed point for four self-maps under conditions that the map pairs satisfy a common property (EA) and are closed, JSR mappings satisfying an inequality involving the probabilistic distance functions.
Density theorems for Euclidean point configurationsVjekoslavKovac1
1. The document discusses density theorems for point configurations in Euclidean space. Density theorems study when a measurable set A contained in Euclidean space can be considered "large".
2. One classical result is that for any measurable set A contained in R2 with positive upper Banach density, there exist points in A whose distance is any sufficiently large real number. This has been generalized to higher dimensions and other point configurations.
3. Open questions remain about determining all point configurations P for which one can show that a sufficiently large measurable set A contained in high dimensional Euclidean space must contain a scaled copy of P.
The document discusses using the renormalization group to build a "tower" of connected field theories across dimensions, starting from known 2-dimensional conformal field theories. It focuses on analyzing the O(N) x O(m) Landau-Ginzburg-Wilson model in 6 dimensions, which is connected to the 4D theory through a Wilson-Fisher fixed point. Perturbative calculations and the large N expansion are used to calculate critical exponents and check that the theories are in the same universality class. Studying higher dimensional theories could provide insight into physics beyond the Standard Model.
On maximal and variational Fourier restrictionVjekoslavKovac1
Workshop talk slides, Follow-up workshop to trimester program "Harmonic Analysis and Partial Differential Equations", Hausdorff Institute, Bonn, May 2019.
This document introduces the concept of weak triple connected domination number (γwtc) of a graph. A subset S of vertices is a weak triple connected dominating set if S is a weak dominating set and the induced subgraph <S> is triple connected. The γwtc is defined as the minimum cardinality of such a set. Some standard graphs are used to illustrate the concept and determine this number. Bounds on γwtc are obtained for general graphs, and its relationship to other graph parameters are investigated. The paper aims to develop this new graph invariant and establish basic results about weak triple connected domination.
A function f is called a graceful labelling of a graph G with q edges if f is an injection
from the vertices of G to the set {0, 1, 2, . . . , q} such that, when each edge xy is assigned the
label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo
N graceful (where N is a positive integer) if there is a function φ from the vertex set of G to
{0, 1,N, (N + 1), 2N, (2N + 1), . . . ,N(q − 1),N(q − 1) + 1} in such a way that (i) φ is 1 − 1 (ii)
φ induces a bijection φ_ from the edge set of G to {1,N + 1, 2N + 1, . . . ,N(q − 1) + 1} where
φ_(uv)=|φ(u) − φ(v)| . In this paper we prove that the every regular bamboo tree and coconut tree
are one modulo N graceful for all positive integers N .
Tales on two commuting transformations or flowsVjekoslavKovac1
1) The document summarizes recent work on ergodic averages and flows for commuting transformations. It discusses convergence results for single and double linear ergodic averages in L2 and almost everywhere, as well as providing norm estimates to quantify the rate of convergence.
2) It also considers double polynomial ergodic averages and provides proofs for almost everywhere convergence in the continuous-time setting. Open problems remain for the discrete-time case.
3) An ergodic-martingale paraproduct is introduced, motivated by an open question from 1950. Convergence in Lp norm is shown, while almost everywhere convergence remains open.
New Classes of Odd Graceful Graphs - M. E. Abdel-AalGiselleginaGloria
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. We
prove that, the m-shadow graphs for paths, complete bipartite graphs and symmetric product between
paths and null graphs are odd graceful. In addition, we show that, the m-splitting graphs for paths, stars
and symmetric product between paths and null graphs are odd graceful. Finally, we present some examples
to illustrate the proposed theories.
The document is an academic paper that discusses odd harmonious labelings of cyclic snake graphs. It contains the following key points:
1) It generalizes previous results by showing that the -nkC snake graph with a string of all 1s is odd harmonious when n is congruent to 0 modulo 4.
2) It proves that the -4kC snake graph with m pendant edges attached to each vertex, for m ≥ k, is odd harmonious for both the linear and general cases.
3) It shows that all subdivisions of the 2kmΔ snake graph are odd harmonious for m ≥ k. Examples are provided to illustrate the theories.
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent to 0 or 2 (mod 4), and we found a counter example for the inverse of this statement is not true. We also proved that, the graphs which are constructed by two copies of even cycle Cn sharing a common edge are odd harmonious. In addition, we obtained an odd harmonious labeling for the graphs which are constructed by two copies of cycle Cn sharing a common vertex when n is congruent to 0 (mod 4). Moreover, we show that, the Cartesian product of cycle graph Cm and path Pn for each n ≥ 2, m ≡ 0 (mod 4) are odd harmonious graphs. Finally many new families of odd harmonious graphs are introduced.
On the Odd Gracefulness of Cyclic Snakes With Pendant EdgesGiselleginaGloria
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs. In particular we show an odd graceful labeling of the linear 4 1 kC snake mK − e and therefore we introduce the odd graceful labeling of 4 1 kC snake mK − e ( for the general case ). We prove that the subdivision of linear 3 kC snake − is odd graceful. We also prove that the subdivision of linear 3 kC snake − with m-pendant edges is odd graceful. Finally, we present an odd graceful labeling of the crown graph P mK n 1 e .
Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in GraphsIJERA Editor
In this paper we study about x-geodominating set, geodetic set, geo-set, geo-number of a graph G. We study the
binary operation, link vectors and some required results to develop algorithms. First we design two algorithms
to check whether given set is an x-geodominating set and to find the minimum x-geodominating set of a graph.
Finally we present another two algorithms to check whether a given vertex is geo-vertex or not and to find the
geo-number of a graph.
This document provides an introduction to graph theory concepts. It defines what a graph is consisting of vertices and edges. It discusses different types of graphs like simple graphs, multigraphs, digraphs and their properties. It introduces concepts like degrees of vertices, handshaking lemma, planar graphs, Euler's formula, bipartite graphs and graph coloring. It provides examples of special graphs like complete graphs, cycles, wheels and hypercubes. It discusses applications of graphs in areas like job assignments and local area networks. The document also summarizes theorems regarding planar graphs like Kuratowski's theorem stating conditions for a graph to be non-planar.
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles graphhoc
In 1991, Gnanajothi [4] proved that the path graph n
P with n vertex and n −1edge is odd graceful, and
the cycle graph Cm with m vertex and m edges is odd graceful if and only if m even, she proved the
cycle graph is not graceful if m odd. In this paper, firstly, we studied the graphCm∪Pn when m = 4, 6,8,10
and then we proved that the graphCm∪Pn
is odd graceful if m is even. Finally, we described an
algorithm to label the vertices and the edges of the vertex set ( ) m n
V C ∪P and the edge set ( ) m n
E C ∪P .
This document discusses operations on interval-valued fuzzy graphs. It begins with an introduction to fuzzy graphs and definitions related to fuzzy graph theory. It then presents the main results which prove properties of the union and join operations on interval-valued fuzzy graphs. Specifically, it proves that the union of two interval-valued fuzzy graphs G1 and G2 is isomorphic to their join, and vice versa. It also discusses subgraphs, complements, and neighbors in fuzzy graph theory.
The document discusses various graph labeling concepts such as Z3-vertex magic total labeling, Z3-edge magic total labeling, and total magic cordial labeling. It proves that these labelings exist for the extended duplicate graph of a comb graph and the middle graph of the extended duplicate graph of a path graph. An algorithm is provided to obtain an n-edge magic labeling for the extended duplicate graph of a comb graph. The document also discusses the structures of these graphs.
The document discusses graph theory and provides definitions and examples of various graph concepts. It defines what a graph is consisting of vertices and edges. It also defines different types of graphs such as simple graphs, multigraphs, digraphs and provides examples. It discusses graph terminology, models, degree of graphs, handshaking lemma, special graphs and applications. It also provides explanations of planar graphs, Euler's formula and graph coloring.
A common fixed point of integral type contraction in generalized metric spacessAlexander Decker
This document presents a common fixed point theorem for two self-mappings S and T on a G-metric space X that satisfies a contractive condition of integral type. It begins with definitions related to G-metric spaces and contractive conditions. It then states Theorem 1.1, which proves that if S and T satisfy the given integral type contractive condition, along with other listed conditions, then S and T have a unique point of coincidence in X. If S and T are also weakly compatible, then they have a unique common fixed point. The proof of Theorem 1.1 is then provided.
The document summarizes some new families of graphs that admit H-cordial and H2-cordial labelings. Specifically:
1) The graphs obtained by duplicating vertices or edges in the cycle Cn for n≥3 admit H2-cordial labelings.
2) The joint sum of two copies of the cycle Cn of even order produces an H2-cordial labeling graph.
3) The split graph of the cycle Cn for even n is H-cordial.
4) The shadow graph D2(Pn) of the path Pn is H-cordial for even n.
The document provides definitions, theorems with proofs, and examples
This document summarizes research into the properties of hypercube graphs. It defines key graph theory concepts such as distance regular graphs and adjacency matrices. It then presents results about hypercube characteristics, such as the structure of their adjacency matrices and structure matrices. Several conjectures are posed about hypercube eigenvalues and the idempotent matrix E_n-2. Questions are raised for further research, such as determining if an algorithm for E_n-2 is true and if all hypercubes are self-dual.
ODD GRACEFULL LABELING FOR THE SUBDIVISON OF DOUBLE TRIANGLES GRAPHSijscmcj
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd graceful labeling of the all subdivision of double triangular snakes ( 2∆k -snake ). We also prove that the all subdivision of 2 m∆1-snake are odd graceful. Finally, we generalize the above two results (the all subdivision of 2 m∆k -snake are odd graceful).
The document provides notes on group theory. It discusses the definition of groups and examples of groups such as (Z, +), (Q, ×), and Sn. Properties of groups like Lagrange's theorem and criteria for subgroups are also covered. The notes then discuss symmetry groups, defining isometries of R2 and showing that the set of isometries forms a group. Symmetry groups G(Π) of objects Π in R2 are introduced and shown to be subgroups. Specific examples of symmetry groups like those of triangles, squares, regular n-gons, and infinite strips are analyzed. Finally, the concept of group isomorphism is defined and examples are given to illustrate isomorphic groups.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
On algorithmic problems concerning graphs of higher degree of symmetrygraphhoc
Since the ancient determination of the five platonic solids the study of symmetry and regularity has always
been one of the most fascinating aspects of mathematics. One intriguing phenomenon of studies in graph
theory is the fact that quite often arithmetic regularity properties of a graph imply the existence of many
symmetries, i.e. large automorphism group G. In some important special situation higher degree of
regularity means that G is an automorphism group of finite geometry. For example, a glance through the
list of distance regular graphs of diameter d < 3 reveals the fact that most of them are connected with
classical Lie geometry. Theory of distance regular graphs is an important part of algebraic combinatorics
and its applications such as coding theory, communication networks, and block design. An important tool
for investigation of such graphs is their spectra, which is the set of eigenvalues of adjacency matrix of a
graph. Let G be a finite simple group of Lie type and X be the set homogeneous elements of the associated
geometry. The complexity of computing the adjacency matrices of a graph Gr on the vertices X such that
Aut GR = G depends very much on the description of the geometry with which one starts. For example, we
can represent the geometry as the totality of 1 cosets of parabolic subgroups 2 chains of embedded
subspaces (case of linear groups), or totally isotropic subspaces (case of the remaining classical groups), 3
special subspaces of minimal module for G which are defined in terms of a G invariant multilinear form.
The aim of this research is to develop an effective method for generation of graphs connected with classical
geometry and evaluation of its spectra, which is the set of eigenvalues of adjacency matrix of a graph. The
main approach is to avoid manual drawing and to calculate graph layout automatically according to its
formal structure. This is a simple task in a case of a tree like graph with a strict hierarchy of entities but it
becomes more complicated for graphs of geometrical nature. There are two main reasons for the
investigations of spectra: (1) very often spectra carry much more useful information about the graph than a
corresponding list of entities and relationships (2) graphs with special spectra, satisfying so called
Ramanujan property or simply Ramanujan graphs (by name of Indian genius mathematician) are important
for real life applications (see [13]). There is a motivated suspicion that among geometrical graphs one
could find some new Ramanujan graphs.
AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHSFransiskeran
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric → + Gd
: X × X × X R where X = r(v /W) =
{(d(v,v1
),d(v,v2
),...,d(v,vk
/) v∈V (G))}, denoted Gd
and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if Gd
numbers of pendant edges are added to the non-basis vertices.
Similar to FURTHER RESULTS ON ODD HARMONIOUS GRAPHS (18)
SELECTIVE WATCHDOG TECHNIQUE FOR INTRUSION DETECTION IN MOBILE AD-HOC NETWORKFransiskeran
Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are self organizing and are
connected by wireless links where nodes which are not in the direct range communicate with each other
relying on the intermediate nodes. As a result of trusting other nodes in the route, a malicious node can
easily compromise the security of the network. A black-hole node is the malicious node which drops the
entire packet coming to it and always shows the fresh route to the destination, even if the route to
destination doesn't exist. This paper describes a scheme that will detect the intrusion in the network in the
presence of black-hole node and its performance is compared with the previous technique. This novel
technique helps to increase the network performance by reducing the overhead in the network.
IMPACT OF ENERGY AND LINK QUALITY INDICATOR WITH LINK QUALITY ESTIMATORS IN W...Fransiskeran
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
CA-MWSN: CLUSTERING ALGORITHM FOR MOBILE WIRELESS SENOR NETWORKFransiskeran
This paper proposes a centralized clustering algorithm (CA-MWSN) for selecting cluster heads in mobile wireless sensor networks. The base station first performs dynamic clustering based on sensor location updates. It then runs CA-MWSN, which uses fuzzy logic to calculate each node's "chance" of being elected cluster head based on residual energy, expected residual energy, and mobility. The node with the highest chance is selected as the cluster head for that round. Dynamic clustering and CA-MWSN aim to provide uniform energy distribution in mobile sensor networks where nodes may become densely or sparsely distributed.
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRYFransiskeran
Since the ancient determination of the five platonic solids the study of symmetry and regularity has always
been one of the most fascinating aspects of mathematics. One intriguing phenomenon of studies in graph
theory is the fact that quite often arithmetic regularity properties of a graph imply the existence of many
symmetries, i.e. large automorphism group G. In some important special situation higher degree of
regularity means that G is an automorphism group of finite geometry. For example, a glance through the
list of distance regular graphs of diameter d < 3 reveals the fact that most of them are connected with
classical Lie geometry. Theory of distance regular graphs is an important part of algebraic combinatorics
and its applications such as coding theory, communication networks, and block design. An important tool
for investigation of such graphs is their spectra, which is the set of eigenvalues of adjacency matrix of a
graph. Let G be a finite simple group of Lie type and X be the set homogeneous elements of the associated
geometry.
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKFransiskeran
Metric dimension in graph theory has many applications in the real world. It has been applied to the
optimization problems in complex networks, analyzing electrical networks; show the business relations,
robotics, control of production processes etc. This paper studies the metric dimension of graphs with
respect to contraction and its bijection between them. Also an algorithm to avoid the overlapping between
the robots in a network is introduced.
EVEN GRACEFUL LABELLING OF A CLASS OF TREESFransiskeran
A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G that
induces for each edge uv a labelling depending on the vertex labels f(u) and f(v). A labelling is called a
graceful labelling if there exists an injective function f: V (G) → {0, 1,2,......q} such that for each edge xy,
the labelling │f(x)-f(y)│is distinct. In this paper, we prove that a class of Tn trees are even graceful.
SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATIONFransiskeran
This document summarizes research on ant colony optimization (ACO), a metaheuristic algorithm inspired by the foraging behavior of ants. It describes how real ant colonies use pheromone trails to efficiently find short paths between their nest and food sources through decentralized cooperation. The document then explains how ACO works by simulating artificial ants that probabilistically construct solutions and update pheromone values to guide future construction. Several standard ACO algorithms are outlined, including Ant System, Ant Colony System, Max-Min Ant System, and Rank-Based Ant System. Applications of ACO discussed include the traveling salesman problem.
A NOVEL INTRUSION DETECTION SYSTEM FOR DETECTING BLACK-HOLE NODES IN MANETSFransiskeran
The document summarizes a research paper that proposes a novel intrusion detection system to detect black-hole nodes in mobile ad hoc networks (MANETs). It first provides background on MANETs and the black-hole attack. It then describes how the Ad hoc On-Demand Distance Vector (AODV) routing protocol works and its vulnerabilities. Next, it discusses existing work on detecting black-hole attacks and outlines the proposed algorithm, which will detect black-hole nodes by implementing changes to the AODV routing protocol and simulating it using the NS-2 network simulator.
The Neighborhood Broadcast Problem in Wireless Ad Hoc Sensor NetworksFransiskeran
This document discusses the neighborhood broadcast problem in wireless ad hoc sensor networks. It presents the k-Hop Bouncing Flood (k-HBF) network protocol to distribute a message to all neighbors of a network node without that node's participation. The k-HBF protocol is proven to guarantee delivery if k is greater than or equal to 2d-1, where d is the local connectivity distance of the node. It involves resetting the transmission counter at neighbors of the target node to bounce the message within its neighborhood. Simulations show the protocol has very high success rates for low values of k.
In this work we have devoted to some proposed analytical methods to simulate these attacks, and node
mobility in MANET. The model used to simulate the malicious nodes mobility attacks is based on graphical
theory, which is a tool for analyzing the behavior of nodes. The model used to simulate the Blackhole
cooperative, Blackmail, Bandwidth Saturation and Overflow attacks is based on malicious nodes and the
number of hops. We conducted a simulation of the attacks with a C implementation of the proposed
mathematical models.
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
1. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
DOI : 10.5121/jgraphoc.2016.8401 1
FURTHER RESULTS ON ODD HARMONIOUS
GRAPHS
M. E. Abdel-Aal1
, M. A. Seoud2
1
Department of Mathematics, Faculty of Science,
Banha University, Banha 13518, Egypt
2
Department of Mathematics, Faculty of Science,
Ain Shams University, Abbassia, Cairo, Egypt.
ABSTRACT
In [1] Abdel-Aal has introduced the notions of m-shadow graphs and n-splitting graphs, for all 1, ≥nm .
In this paper, we prove that, the m-shadow graphs for paths and complete bipartite graphs are odd
harmonious graphs for all 1≥m . Also, we prove the n-splitting graphs for paths, stars and symmetric
product between paths and null graphs are odd harmonious graphs for all 1≥n . In addition, we present
some examples to illustrate the proposed theories. Moreover, we show that some families of graphs admit
odd harmonious libeling.
KEYWORDS
Odd harmonious labeling, m-shadow graph, m-splitting graph.
MATHEMATICS SUBJECT CLASSIFICATION : 05C78, 05C76, 05C99.
1. INTRODUCTION
We begin with simple, finite, connected and undirected graph G = (V, E) with p vertices and q
edges. For all other standard terminology and notions we follow Harary[4].
Harmonious graphs naturally arose in the study by Graham and Sloane [3].
They defined a graph G with q edges to be harmonious if there is an injection f from the vertices
of G to the group of integers modulo q such that when each edge xy is assigned the label f(x) +
f(y) (mod q), the resulting edge labels are distinct.
A graph G is said to be odd harmonious if there exists an injection
f: V(G) → {0, 1, 2, …, 2q-1} such that the induced function f* : E(G) →{1, 3, . . . , 2q − 1}
defined by f*(uv) = f(u) + f(v) is a bijection. Then f is said to be an odd harmonious labeling of G
[5]. A graph which has odd harmonious labeling is called odd harmonious graph.
For a dynamic survey of various graph labeling problems we refer to Gallian [2].
2. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
2
Liang and Bai [5] obtained the necessary conditions for the existence of odd harmonious labeling
of a graph. They proved that if G is an odd harmonious graph, then G is a bipartite graph. Also
they claim that if a (p, q) − graph G is odd harmonious, then 122 −≤≤ qpq , but this is not
always correct. Take 2P as a counter example.
In [1] Abdel-Aal has introduced an extension for shadow graphs and splitting graphs. Namely,
for any integers 1≥m , the m-shadow graph denoted by )(GDm and the m- splitting graph
denoted by Splm(G) are defined as follows:
Definition 1.1. [1] The m-shadow graph )(GDm of a connected graph G is constructed by taking
m-copies of G , say mGGGG ,...,,, 321 , then join each vertex u in Gi to the neighbors of the
corresponding vertex v in Gj , mji ≤≤ ,1 .
Definition 1.2. [1] The m- splitting graph Splm(G) of a graph G is obtained by adding to each
vertex v of G new m vertices, say m
vvvv ...,,,, 321
, such that i
v , mi ≤≤1 is adjacent to every
vertex that is adjacent to v in G.
Vaidya and Shah [6] proved that the shadow graphs of the path nP and the star nK ,1 are odd
harmonious. Further they prove that the splitting graphs of the path nP and the star nK ,1 admit
odd harmonious labeling.
In this paper, we initiate the study by proving that )( nm PD , for each 1, ≥nm is odd harmonious,
and we show that )( ,srm KD for each 1,, ≥srm admits an odd harmonious labeling. Further, we
prove that, the following graphs Splm( nP ), Splm( nK ,1 ), Pn ⊕ mK , Splm (Pn ⊕ 2K ), Splm(P2 ∧ Sn),
Spl (Km,n ) are odd harmonious.
2. MAIN RESULTS
Theorem 2.1.
All connected graphs of order ≤ 6 are not odd harmonious, except the following 25 graphs:
(i) C4 , K2,3 , K2,4 , K3,3 ,
(ii) all non-isomorphic trees of order ≤ 6,
(iii)the following graphs of order ≤ 6
3. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
3
Figure (1)
Proof.
The graphs in (i) are odd harmonious by theorems due to Liang and Bai [5]; note that the graphs
in case (ii) are exactly 13 non-isomorphic trees of order ≤ 6, and they and the graphs in case (iii)
are shown to be odd harmonious by giving specific odd harmonious labeling assigned to the
vertices of each graph as indicated in Figure (1) and Figure (2). According to Harary [4], the
remaining (118) connected graphs of order ≤ 6, are not odd harmonious by the theorem: “Every
graph with an odd cycle is not odd harmonious” which is also due to Liang and Bai [5].
Figure (2)
Theorem 2.2. )( nm PD is an odd harmonious graph for all m, n ≥ 2.
Proof. Consider m-copies of Pn. Let j
n
jjj
uuuu ...,,,, 321 be the vertices of the jth
-copy of nP . Let
G be the graph )( nm PD . Then |V (G)| = mn and |E (G)| = m2
(n − 1). We define f: V(G) → {0, 1,
2, …, 2 m2
(n − 1) - 1} as follows:
≤≤−=−+−
≤≤−=−+−
=
.1,1...,,6,4,212)2(
,1,1...,,5,3,1)1(2)1(
)( 2
2
mjnornijim
mjnornijmim
uf j
i
It follows that f is an odd harmonious labeling for )( nm PD . Hence )( nm PD is an odd
harmonious graph for each 1, ≥nm .
4. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
4
Example 2.3. An odd harmonious labeling of the graph )( 74 PD is shown in Figure (3).
Figure (3): The graph )( 74 PD with its odd harmonious labeling
Theorem 2.4. )( ,srm KD is an odd harmonious graph for all m, r, s ≥ 1.
Proof. Consider m-copies of Kr,s. Let j
r
jjj
uuuu ...,,,, 321 and j
s
jjj
vvvv ...,,,, 321 be the vertices of
the jth
-copy of Kr,s. Let G be the graph )( ,srm KD . Then |V (G)| = m(r+s) and |E(G)| = m2
rs. We
define
f: V(G) → {0, 1, 2, …, 2 m2
rs - 1}
as follows:
.1,1),1(2)1(2)( mjrijriuf j
i ≤≤≤≤−+−=
.1,1),1(2)1(21)( mjsijmrsimrvf j
i ≤≤≤≤−+−+=
It follows that f is an odd harmonious labeling for )( ,srm KD . Hence )( ,srm KD is an odd
harmonious graph for each m, r, s ≥ 1.
Example 2.5. An odd harmonious labeling of the graph )( 4,33 KD is shown in Figure (4).
Figure (4): The graph D3(K3,4) with its odd harmonious labeling.
The following results give odd-harmonious labeling for the “multisplliting” paths and stars.
5. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
5
Theorem 2.6. Splm(Pn) is an odd harmonious graph.
Proof. Let 00
3
0
2
0
1 ...,,,, nuuuu be the vertices of Pn and suppose j
n
jjj
uuuu ...,,,, 321 , mj ≤≤1 be
the jth
vertices corresponding to 00
3
0
2
0
1 ...,,,, nuuuu , which are added to obtain Splm(Pn). Let G be
the graph Splm(Pn) described as indicated in Figure(5)
Figure (5)
Then |V (G)| = n(m+1) and |E(G)| = (n − 1)(2m+1). We define
f : V(G) → {0, 1, 2, …, 2 (n − 1)(2m+1) - 1} as follows:
.1,1)( 0
niiuf i ≤≤−=
≤≤−=−+−−
≤≤−=−+−
=
.1,1...,,6,4,2,1)12)(1(2
,1,1...,,5,3,1,1)1(4
)(
mjnorniijn
mjnorniijn
uf j
i
It follows that f admits an odd harmonious labeling for Splm(Pn) . Hence Splm(Pn) is an odd
harmonious graph.
Example 2.7. Odd harmonious labeling of the graph Spl3(P7) is shown in Figure (6).
Figure (6): The graph Spl3(P7) with its odd harmonious labeling.
6. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
6
Theorem 2.8. Splm(K1,n ) is an odd harmonious graph.
Proof. Let nuuuu ...,,,, 321 be the pendant vertices and 0u be the center of K1, n, and
j
n
jjj
uuuu ...,,,, 210 , mj ≤≤1 are the added vertices corresponding to nuuuuu ...,,,,, 3210 to
obtain Splm(K1,n ). Let G be the graph Splm(K1,n ). Then |V (G)| = (n+1)(m+1) and |E(G)| =
n(2m+1). We define the vertex labeling function:
f : V(G) → {0, 1, 2, …, 2n (2m+1) - 1} as follows:
,0)( 0 =uf
,1,12)( niiuf i ≤≤−=
,1,2)( 0 mjnjuf j
≤≤=
.1,1,1])([2)( mjniijmnuf j
i ≤≤≤≤−++=
It follows that f admits an odd harmonious labeling for Splm(K1,n ). Hence Splm(K1,n ) is an odd
harmonious graph
Example 2.9. An odd harmonious labeling of the graph Spl3(K1,3) is shown in Figure (7).
Figure (7) The graph Spl3(K1,3) with its odd harmonious labeling
Remark 2.10.
In Theorem 2.2, if we take m = 2 we obtain the known shadow path and when we take m = 2, r =
1 in Theorem 2.4 we obtain the known shadow star. Also, in Theorems 2.6, 2.8 if we take m = 1
we obtain the splitting path and star. These special cases of our results coincide with results of
Vaidya and Shah [5] (Theorems 2.1, 2.2, 2.3, 2.4).
7. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
7
3. SOME ODD HARMONIOUS GRAPHS
Let G1 and G2 be two disjoint graphs. The symmetric product (G1 ⊕ G2) of G1 and G2 is the
graph having vertex set V(G1) × V(G2) and edge set{(u1, v1) (u2, v2): u1u2∈ E(G1) or v1v2 ∈ E(G2)
but not both}[4].
Theorem 3.1.
The graphs Pn ⊕ mK , m , n ≥ 2 are odd-harmonious.
Proof.
Let Pn ⊕ mK be described as indicated in Figure (8):
Figure(8)
It is clear that the number of edges of the graph Pn ⊕ mK is (3m - 2)(n - 1). We define the
labeling function
f : V(Pn ⊕ mK ) → {0, 1, 2, …, 2(3m - 2)(n - 1) - 1}
as follows:
=−−=−+−−−
=−=−+−−
=
mjnornijmim
mjnornijim
vf j
i
,...3,2,1,11,...6,4,2),1(2)56()23(
,...3,2,1,1,...5,3,1),1(4)1)(23(
)(
It follows that f admits an odd harmonious labeling for Pn ⊕ mK . Hence
Pn ⊕ mK is an odd harmonious graph.
8. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
8
Example 3.2. An odd harmonious labeling of the graph P6 ⊕ 3K is shown in Figure (9).
Figure (9): The graph P6 ⊕ 3K with its odd harmonious labeling.
Theorem 3.3.
The graphs Splm (Pn ⊕ 2K ) , m , n ≥ 2 are odd-harmonious.
Proof. Let nn vvvvuuuu ...,,,,;...,,,, 321321 be the vertices of the graph Pn ⊕ and
suppose j
n
jjj
uuuu ...,,,, 321 , mj ≤≤1 be the jth
vertices corresponding to nuuuu ...,,,, 321 and
j
n
jjj
vvvv ...,,,, 321 , mj ≤≤1 be the jth
vertices corresponding to which are
added to obtain Splm (Pn ⊕ 2K ). The graph Splm (Pn ⊕ 2K ) is described as indicated in Figure
(10)
Figure (10)
2K
nvvvv ...,,,, 321
9. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
9
Then the number of edges of the graph Splm (Pn ⊕ 2K )=4(2m+1)(n-1). We define:
f : V(Splm (Pn ⊕ 2K )) → {0, 1, 2, …8(2m+1)(n-1) - 1}.
First, we consider the labeling for the graph Pn ⊕ 2K as follows:
−=+−+
−=−+++
=
.1,...6,4,2,3)2)(12(4
1,...5,3,1),1)(12(4)1(4
)(
norniim
norniimm
uf i
−=+−+
−=−++
=
.1,...6,4,2,1)2)(12(4
1,...5,3,1),1)(12(44
)(
norniim
norniimm
vf i
For labeling the added vertices mjnivu j
i
j
i ≤≤≤≤ 1,1,, we consider the following three
cases:
Case (i)
if i is odd, ni ≤≤1 we have the following labeling, for each mj ≤≤1
)1)(12(4)(4)( −++−= imjmuf j
i
)1)(12(4)1(4)( −++++= imjmvf j
i
Case (ii)
if i even, ni ≤≤1 and ),2(mod1≡m mj ≤≤1 we have the following labeling:
−=−−++−+
=+−++−+
=
1,...6,4,2,1)2)(12(4)22(4
,...5,3,1,1)2)(12(4)22(4
)(
mjimjm
mjimjm
uf j
i
−=+−++++
=−−++++
=
1,...6,4,2,1)2)(12(4)12(4
,...5,3,1,1)2)(12(4)12(4
)(
mjimjm
mjimjm
vf j
i
10. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
10
Case (iii)
if i even, ni ≤≤1 and ),2(mod0≡m mj ≤≤1 we have the following labeling:
=+−++−+
−=−−++−+
=
mjimjm
mjimjm
uf j
i
,...6,4,2,1)2)(12(4)22(4
1,...5,3,1,1)2)(12(4)22(4
)(
=−−++++
−=+−++++
=
mjimjm
mjimjm
vf j
i
,...6,4,2,1)2)(12(4)12(4
1,...5,3,1,1)2)(12(4)12(4
)(
It follows that f admits an odd harmonious labeling for Splm (Pn ⊕ 2K ). Hence Splm (Pn ⊕ 2K )
is an odd harmonious graph.
Example 3.4. Odd harmonious labelings of graphs Spl2 (P5 ⊕ ) and
Spl3 (P5 ⊕ 2K ) are shown in Figure (11a) and Figure (11b) respectively.
Figure (11a) ),2(mod0≡m Figure (11b), )2(mod1≡m
Figure (11a), Figure (11b): The graphs Spl2 (P5 ⊕ ) and Spl3 (P5⊕ ) with their odd
harmonious labeling.
2K
2K 2K
11. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
11
Let G1 and G2 be two disjoint graphs. The conjunction (G1 ∧ G2) of G1 and G2 is the graph having
vertex set V(G1) × V(G2) and edge set{(u1, v1) (u2, v2): u1u2∈ E(G1) and v1v2 ∈ E(G2)}[4].
Theorem 3.5.
The graphs Splm(P2 ∧ Sn), m , n ≥ 2 are odd harmonious.
Proof.
Let 00
2
0
1
0
0
00
2
0
1
0
0 ...,,,,;...,,,, nn vvvvuuuu be the vertices of the graph P2 ∧ Sn and suppose
j
n
jjjj
uuuuu ...,,,,, 3210 , mj ≤≤1 be the jth
vertices corresponding to 00
2
0
1
0
0 ...,,,, nuuuu and
j
n
jjjj
vvvvv ...,,,,, 3210 , mj ≤≤1 be the jth
vertices corresponding to 00
2
0
1
0
0 ...,,,, nvvvv which are
added to obtain Splm (P2 ∧ Sn). The graph Splm (P2 ∧ Sn) is described as indicated in figure (12)
Figure (12)
It is clear that the number of edges of the graph Splm (P2 ∧ Sn) is 2n(2m+1). Now we define the
labeling function
f: V(Splm (P2 ∧ Sn)) → {0, 1, 2, …, 4n(2m+1)-1},
as follows:
mjjnmuf j
≤≤+−+= 0,21)22()( 0
mjjmvf j
≤≤−+= 0,2)12()( 0
nimmivf i ≤≤−+= 1,2)1(2)( 0
niimuf i ≤≤−+= 1,)1)(1(2)( 0
Now we label the remaining vertices j
iu , j
iv , ni ≤≤1 , mj ≤≤1 as follows:
12. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
12
For the vertices j
iv : we put the labeled vertices m
iiii vvvv ,...,,, 321
, ni ≤≤1 , ordered from bottom
to top in columns as in Example 3.6, the labels form an arithmetic progression whose basis is 2
and whose first term is 2[(m+1)n+1].
Similarly for j
iu : we put the labeled vertices m
iiii uuuu ,...,,, 321
, ni ≤≤1 , ordered from bottom to
top in columns as in Example 3.6, the labels form an arithmetic progression whose basis is 2 and
whose first term is 2[(3n-1)m+2n].
It follows that f admits an odd harmonious labeling for Splm(P2 ∧ Sn). Hence Splm(P2 ∧ Sn) is an
odd harmonious graph.
Example 3.6. An odd harmonious labeling of the graph Spl3 (P2 ∧ S4) is shown in Figure (13).
Figure (13): The graph Spl3 (P2 ∧ S4) with its odd harmonious labeling
Corollary 3.7.
The following known graphs are odd harmonious:
1. Spl(Sn ∧ P2 ) , n ≥ 2
2. Spl(Pn ⊕ 2K ) , n ≥ 2
Theorem 3.8.
The graphs Spl (Km,n ), m , n ≥ 2 are odd harmonious.
Proof.
Let V(Km,n) = {u1, u2, u3, …, um ; v1, v2, v3, …, vn}, m, n ≥ 2. It is clear that the number of edges
of the graph Spl(Km,n) is 3mn. The graph is indicated in Figure (14):
13. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
13
Figure (14)
We define the labeling function
f : V(Spl(Km,n )) → {0, 1, 2, …, 6mn - 1} as follows:
f (vi ) = 4i - 3 , 1 ≤ i ≤ m
f( ui ) = 6n( i -1 ) , 1 ≤ i ≤ n
f( ) = 4n+2i-1 , 1 ≤ i ≤ m
f( ) = 2+6n(i-1) , 1 ≤ i ≤ n.
It follows that f admits an odd harmonious labeling for Spl(Km,n ). Hence Spl(Km,n ) is an odd
harmonious graph.
Example 3.9. Odd harmonious labeling of graph Spl(K3,4 ) is shown in Figure (15).
Figure (15): The graph Spl(K3,4 ) with its odd harmonious labeling
1
iv
1
iu
14. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.8, No.3/4, December 2016
14
REFERENCES
[1] M. E. Abdel-Aal. New Classes of Odd Graceful Graphs, J. (GRAPH-HOC) Vol. 5, No. 2 (2013), 1-
12.
[2] J. A. Gallian. A Dynamic Survey of Graph Labeling, Electronic J. Combin. Fiftteenth edition, (2012).
[3] R. L. Graham, N. J. A. Sloane. On additive bases and harmonious graphs, SIAM J. Algebr. Disc.
Math., 4 (1980), 382-404.
[4] F. Harary. GpaphTheory, Addison-Wesley, Reading MA (1969).
[5] Z. Liang, Z. Bai. On the odd harmonious graphs with applications, J. Appl.Math. Comput., 29
(2009), 105-116.
[6] S.K. Vaidya, N. H. Shah. Some new odd harmonious graphs, International Journal of Mathematics
and Soft Computing, 1 (2011), 9-16.
AUTHOR
Mohamed Elsayed Abdel-Aal received the B.Sc. (Mathematics) the M.Sc.(Pure
Mathematics-Abstract Algebra) degree from Benha University, Benha, Egypt in 1999,
2005 respectively. Also, he received Ph.D. (Pure Mathematics) degree from Faculty
of Mathematics, Tajik National University, Tajikistan, in 2011. He is a University
lecturer of Pure Mathematics with the Benha University, Faculty of Science,
Department of Pure Mathematics. His current research is Ordinary –partial
differential equations, Graph Theory and Abstract Algebra.