• No results found

Graph Labeling

k-Product Graph Labeling

k-Product Graph Labeling

... of graph G are denoted by V(G) and E(G) respectively. For various graph theoretic notations and terminology we follow Harry [1] and for number theory we follow Burton ...A graph labeling is an ...

10

Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method

Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method

... The graphs we consider are finite, simple, undirected and connected. The word cordial was used by I. Cahit in defining “ cordial labeling” [3].That assignment of numbers to edges ( to vertices) that results in ...

5

Some Graph Labeling on Inflated Graph of Triangular Snake and Alternate Triangular Snake Graph

Some Graph Labeling on Inflated Graph of Triangular Snake and Alternate Triangular Snake Graph

... A graph which admits a difference cordial labeling is called a difference cordial ...every graph is a sub graph of a difference cordial graph and any r − regular graph with r ≥ 4 ...

8

Integer Cordial Labeling of Triangular Snake Graph

Integer Cordial Labeling of Triangular Snake Graph

... G V G E G having set of vertices V G   and set of edges E G   . For the standard notation, we refer Gross and Yellen. 2 The concept of cordial labeling was introduced by I. Cahit 3 in 1987. Definition-1.1: If ...

9

The Cordial Labeling for the Four-Leaved Rose Graph

The Cordial Labeling for the Four-Leaved Rose Graph

... A graph coloring is one of the oldest problems of graph ...of graph labeling may be back to 1852 when De Morgen asked : what is the least possible number of colors needed to fill in any map on ...

9

Labelings on Jahangir Graph and Extended Duplicate Graph of Jahangir Graph

Labelings on Jahangir Graph and Extended Duplicate Graph of Jahangir Graph

... A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...cordial labeling for the Jahangir graph and also we show the existence of even and odd mean ...

9

Some Cordial Labeling of Duplicate Graph of Ladder Graph

Some Cordial Labeling of Duplicate Graph of Ladder Graph

... of graph labeling was introduced by Rosa in 1967[2]. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...the labeling is called a vertex ...

8

Prime Cordial Labeling for Theta Graph

Prime Cordial Labeling for Theta Graph

... in graph theory. Graph labeling is an active area of research in graph theory which has rigorous applications in coding theory, communication networks, optimal circuits layouts and ...on ...

8

Heronian Mean Labeling In The Context of Duplication Of Graph Elements

Heronian Mean Labeling In The Context of Duplication Of Graph Elements

... of graph labeling was introduced by Rosa in 1967.A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...the labeling is called a vertex ...

5

A Study on Magic Labeling Regular Graph

A Study on Magic Labeling Regular Graph

... A labeling of a graph G (V, E) is a mapping from the set of vertices, edges, or both vertices and edges to the set of ...magic-type labeling we require the sum of labels related to a vertex (a vertex ...

6

Mean, Odd Mean And Even Mean Labeling For the Extended Duplicate Graph of Kite Graph

Mean, Odd Mean And Even Mean Labeling For the Extended Duplicate Graph of Kite Graph

... Graph theory is an area in discrete mathematics which studies ...a graph, we mean a finite, undirected simple graph G = (V,E) with p vertices and q ...of graph labeling we refer to ...

6

Super Harmonic Mean Labeling of Some Graphs

Super Harmonic Mean Labeling of Some Graphs

... undirected graph G = (V, E) with p-vertices and ...of graph labeling we refer to Gallian 1 ...mean labeling of graphs in 3 ...mean labeling of graphs in 4 ...mean labeling in 5 ...

11

Some Cycle Related 4-cordial Graphs

Some Cycle Related 4-cordial Graphs

... Keywords: Abelian group; 4-cordial labeling; middle graph; splitting graph; double wheel; flower graph.. A graph labeling is an assignment of integers to the vertices or edges [r] ...

10

Matching in Fuzzy Labeling Graph

Matching in Fuzzy Labeling Graph

... of graph theory. The theory of graph is an extremely useful tool for solving combinatorial problems in different areas such as geometry, algebra, number theory, topology,operations research and computer ...

7

Vol 10, No 1 (2019)

Vol 10, No 1 (2019)

... a graph we mean a finite, undirected and simple ...a graph with 𝑝 vertices and 𝑞 ...on graph labeling we refer to ...star graph and it is denoted by 𝑆 𝑛 ...a graph obtained from ...

7

Face And Total Face Product Cordial Labeling Of Graphs

Face And Total Face Product Cordial Labeling Of Graphs

... a graph, we mean a simple, finite, planar and undirected unless otherwise ...planar graph G means a graph G = (V,E), where V is the set of vertices with |V| = p, E is the set of edges with |E| = q ...

10

Super Face Anti-magic Labeling of Subdivided Prism Graph

Super Face Anti-magic Labeling of Subdivided Prism Graph

... Graph labeling is one major research area in graph ...the graph labeling methods trace their origin to the concept of  -valuation introduced by Rosa ...graceful labeling [4]. ...

9

Absolute Difference of Square Sum and Sum Mean Prime Labeling of Some Path Related Graphs

Absolute Difference of Square Sum and Sum Mean Prime Labeling of Some Path Related Graphs

... a graph G. The graph whose cardinality of the vertex set is called the order of G, denoted by p and the cardinality of the edge set is called the size of the graph G, denoted by ...A graph ...

5

Sum Divisor Cordial Labeling of Theta Graph

Sum Divisor Cordial Labeling of Theta Graph

... graph labeling, we refer to Gallian [1] ...Theta graph and some graph operations in Theta graph namely fusion, duplication, switching of a central vertex, path union of two copies and ...

8

Antimagic Total Labeling of r-Copies of Harary Graphs

Antimagic Total Labeling of r-Copies of Harary Graphs

... A graph G = (V(G) , E(G)) consists of a non-empty set of vertices called the vertex set V(G) and a set of edges which are ordered or unordered pair of elements of V(G) called the edge set E(G) where each edge e in ...

7

Show all 8746 documents...

Related subjects