Preferred Language
Articles
/
jih-3014
On Antimagic Labeling for Some Families of Graphs
...Show More Authors

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Dec 08 2022
Journal Name
Aequationes Mathematicae
On graceful antimagic graphs
...Show More Authors

View Publication
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Some New Results on Lucky Labeling
...Show More Authors

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations
...Show More Authors

Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph
...Show More Authors

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue Nov 01 2011
Journal Name
Australian Journal Of Basic And Applied Sciences
Closure Operators on Graphs
...Show More Authors

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

View Publication Preview PDF
Publication Date
Sun Nov 22 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Topological Structure of Generalized Rough Graphs
...Show More Authors

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.

View Publication Preview PDF
Crossref
Publication Date
Tue Dec 05 2023
Journal Name
Baghdad Science Journal
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
...Show More Authors

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

View Publication Preview PDF
Scopus Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Stability of Complement Degree Polynomial of Graphs
...Show More Authors

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of Computer Sciences
Connectedness in Graphs and Gm-Closure Spaces
...Show More Authors

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

Preview PDF
Publication Date
Sun Dec 09 2018
Journal Name
Baghdad Science Journal
Tadpole Domination in Graphs
...Show More Authors

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

View Publication Preview PDF
Scopus (29)
Crossref (2)
Scopus Clarivate Crossref