Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Muhammad Awais Umar"'
Publikováno v:
AIMS Mathematics, Vol 5, Iss 6, Pp 6043-6050 (2020)
A family of subgraphs of a finite, simple and connected graph $G$ is called an edge covering of $G$ if every edge of graph $G$ belongs to at least one of the subgraphs. In this manuscript, we define the edge covering of a stacked book graph and its u
Externí odkaz:
https://doaj.org/article/9867424aa83f4b349e4f8a0026fc8daf
Publikováno v:
IEEE Access, Vol 8, Pp 109801-109806 (2020)
Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmissio
Externí odkaz:
https://doaj.org/article/90fd85fffe7848d682cb83b277230389
Publikováno v:
IEEE Access, Vol 7, Pp 147345-147349 (2019)
A finite simple graph $G$ is called a $(c,d)$ - $H$ -antimagic if $G$ satisfies the following properties: (i) $G$ has an $H$ -covering by the family of subgraphs $H_{1},H_{2}, {\dots },H_{r}$ where every $H_{t}\cong H, 1\leq t\leq r$ , (ii) there exi
Externí odkaz:
https://doaj.org/article/282212e5786a47f9b81f3083771725c8
Publikováno v:
IEEE Access, Vol 7, Pp 155299-155303 (2019)
Let $M=(V(M),E(M))$ be a simple graph with finite vertices and edges. An $N$ -covering of $M$ is a family $\{N_{1}, N_{2}, {\dots },N_{\alpha }\}$ of subgraphs of $M$ isomorphic to $N$ such that every edge in $E(M)$ belongs to $N_{l}$ , for some $l,~
Externí odkaz:
https://doaj.org/article/69a61b26a82b4656a5eb2c161d855c9f
Publikováno v:
Journal of Mathematics, Vol 2020 (2020)
Graph theory and its wide applications in natural sciences and social sciences open a new era of research. Making the graph of computer networks and analyzing it with aid of graph theory are extensively studied and researched in the literature. An im
Externí odkaz:
https://doaj.org/article/5ffc96826d2a4d45b6d3706756532aa1
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 23:1381-1390
In this paper, we investigate the cordiality of the isomorphic copies of paths mPn . We also give sufficient condition for mPn to admit the prime cordial labeling, product cordial labeling and tota...
Autor:
Suruchi Bhadwal, Katharine Vincent, Tanzina Dilshad, Muhammad Awais Umar, Arjun Srinivas, Amina Maharjan, Krity Shrestha, Sultan Ishaq, Chandni Singh, Natalie Suckall, Mohammad Rashed Alam Bhuiyan, Shouvik Das, Ricardo Safra de Campos, Tuhin Ghosh
Publikováno v:
Current Climate Change Reports. 6:1-16
Purpose of Review South Asia is highly vulnerable to the impacts of climate change, owing to the high dependency on climate-sensitive livelihoods and recurrent extreme events. Consequently, an increasing number of households are adopting labour migra
Publikováno v:
Open Journal of Mathematical Sciences, Vol 4, Iss 1, Pp 18-22 (2020)
A graph \(\Gamma\) (simple, finite, undirected) with an \(\Omega\)-covering has an \((\alpha,\delta)\)-\(\Omega\)-antimagic labeling if the weights of all subgraphs \(\Omega\) of graph \(\Gamma\) constitute an arithmetic progression with the common d
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 24:71-80
Graph ϒ = (V(ϒ), E(ϒ)) contain finite nodes V(ϒ) and finite edges E(ϒ). We also represent the order of the graph and size as μ = |V(ϒ)| and v = |V(ϒ)|. A graph is called (a, d)-edge magic total (EA...
Publikováno v:
Open Journal of Mathematical Sciences, Vol 3, Iss 1, Pp 184-190 (2019)
Let \(G=(V,E)\) be a finite simple graph with \(v =|V(G)|\) vertices and \(e=|E(G)|\) edges. Further suppose that \(\mathbb{H}:=\{H_1, H_2, \dots, H_t\}\) is a family of subgraphs of \(G\). In case, each edge of \(E(G)\) belongs to at least one of th