A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the well-known vertex irregular and edge irregular total labeling of graphs and the idea of the entire colouring of plane graph. A face irregular entire k-labeling ðœ†:ð‘‰âˆªð¸âˆªð¹â†’{1,2,⋯,ð‘˜} of a 2-connected plane graph ðº=(ð‘‰,ð¸,ð¹) is a labeling of vertices, edges, and faces of ðº such that for any two different faces ð‘“ and ð‘”, their weights ð‘¤ðœ†(ð‘“) and ð‘¤ðœ†(ð‘“) are distinct. The minimum 𑘠for which a plane graph ðº has a face irregular entire ð‘˜-labeling is called the entire face irregularity strength of ðº, denoted by ð‘’ð‘“ð‘ (ðº). This paper deals with the entire face irregularity strength of a book with ð‘š ð‘›-polygonal ...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
Pelabelan total tak teratur total yang diperkenalkan oleh Marzuki, dkk merupakan kombinasi dari dua ...
The aim of the paper is to classify certain geometric structures, called arcs. The main computing to...
This paper deals with the total irregularity strength of complete bipartite graph where ...
Graph labeling is the labeling of graph elements such as vertex, edge and both. distance vertex irre...
Let ðº = (ð‘‰, ð¸) be a graph. A total labeling ð‘“: 𑉠∪ ð¸ → {1, 2, ⋯ , ð‘˜} iscalled a tot...
Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge ...
Let G in this paper be a connected and simple graph with set V(G) which is called a vertex and E(G) ...
This paper deals with the totally irregular total labeling of the corona product of a path with path...
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an ass...
Let be a graph with and are the set of its vertices and edges, respectively. Total...
Let be a graph with vertex set and edge set . An r-dynamic vertex coloring of a graph is a assign...
Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A ...
Let be a simple connected graph of order Let be the family of connected vertex-edge dominating set...
The path graph , consists of the vertex set and the edge set . The cycle graph , is the path graph...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
Pelabelan total tak teratur total yang diperkenalkan oleh Marzuki, dkk merupakan kombinasi dari dua ...
The aim of the paper is to classify certain geometric structures, called arcs. The main computing to...
This paper deals with the total irregularity strength of complete bipartite graph where ...
Graph labeling is the labeling of graph elements such as vertex, edge and both. distance vertex irre...
Let ðº = (ð‘‰, ð¸) be a graph. A total labeling ð‘“: 𑉠∪ ð¸ → {1, 2, ⋯ , ð‘˜} iscalled a tot...
Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge ...
Let G in this paper be a connected and simple graph with set V(G) which is called a vertex and E(G) ...
This paper deals with the totally irregular total labeling of the corona product of a path with path...
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an ass...
Let be a graph with and are the set of its vertices and edges, respectively. Total...
Let be a graph with vertex set and edge set . An r-dynamic vertex coloring of a graph is a assign...
Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A ...
Let be a simple connected graph of order Let be the family of connected vertex-edge dominating set...
The path graph , consists of the vertex set and the edge set . The cycle graph , is the path graph...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
Pelabelan total tak teratur total yang diperkenalkan oleh Marzuki, dkk merupakan kombinasi dari dua ...
The aim of the paper is to classify certain geometric structures, called arcs. The main computing to...