Abid-Waheed〖(AW)〗_r^4图的划分维数和支配性

IF 1.2 Q3 MULTIDISCIPLINARY SCIENCES

Baghdad Science Journal Pub Date : 2023-10-20 DOI:10.21123/bsj.2023.8378

Jalal Hatem Hussein Bayati, Abid Mahboob, Muhammad Waheed Rasheed, Dur e Najaf

{"title":"Abid-Waheed〖(AW)〗_r^4图的划分维数和支配性","authors":"Jalal Hatem Hussein Bayati, Abid Mahboob, Muhammad Waheed Rasheed, Dur e Najaf","doi":"10.21123/bsj.2023.8378","DOIUrl":null,"url":null,"abstract":"A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph, a set that is dominant, is a subset of vertex set such that any vertex outside of is close to at least one vertex inside of . The smallest size of for the dominating set is known as the graph’s domination number. When a linked graph H has a vertex x and a subset of the vertex set, the separation between x and S is given by. Pertaining to an ordered k-partition of , the illustration of in relation to Π is to be the k-vectorAbid-Waheed graph is a simply connected graph which contains vertices and edges for all and In this paper, we studied some results on the domination number, independent and restrained domination number denoted by respectively in the Abid-Waheed graphs and the relation between domination number, independent and restrained domination number. Also, the objective of this paper is to generate a partition dimension of.","PeriodicalId":8687,"journal":{"name":"Baghdad Science Journal","volume":"7 1","pages":"0"},"PeriodicalIF":1.2000,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph\",\"authors\":\"Jalal Hatem Hussein Bayati, Abid Mahboob, Muhammad Waheed Rasheed, Dur e Najaf\",\"doi\":\"10.21123/bsj.2023.8378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph, a set that is dominant, is a subset of vertex set such that any vertex outside of is close to at least one vertex inside of . The smallest size of for the dominating set is known as the graph’s domination number. When a linked graph H has a vertex x and a subset of the vertex set, the separation between x and S is given by. Pertaining to an ordered k-partition of , the illustration of in relation to Π is to be the k-vectorAbid-Waheed graph is a simply connected graph which contains vertices and edges for all and In this paper, we studied some results on the domination number, independent and restrained domination number denoted by respectively in the Abid-Waheed graphs and the relation between domination number, independent and restrained domination number. Also, the objective of this paper is to generate a partition dimension of.\",\"PeriodicalId\":8687,\"journal\":{\"name\":\"Baghdad Science Journal\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Baghdad Science Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21123/bsj.2023.8378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Baghdad Science Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21123/bsj.2023.8378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}

引用次数: 0

摘要

用H表示的图，其顶点之间有一个简单的连接，拥有顶点集V(H)。给定一个图，一个占优集，是顶点集的子集，使得图外的任何顶点都至少接近图内的一个顶点。控制集的最小值称为图的控制数。当一个链接图H有一个顶点x和一个顶点集的子集时，x和S之间的间隔由。关于的有序k划分，关于Π的说明为k向量Abid-Waheed图是一个包含所有顶点和边的单连通图，本文研究了Abid-Waheed图中分别表示的统治数、独立统治数和受约束统治数以及统治数、独立统治数和受约束统治数之间的关系的一些结果。同时，本文的目标是生成的分区维数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph

A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph, a set that is dominant, is a subset of vertex set such that any vertex outside of is close to at least one vertex inside of . The smallest size of for the dominating set is known as the graph’s domination number. When a linked graph H has a vertex x and a subset of the vertex set, the separation between x and S is given by. Pertaining to an ordered k-partition of , the illustration of in relation to Π is to be the k-vectorAbid-Waheed graph is a simply connected graph which contains vertices and edges for all and In this paper, we studied some results on the domination number, independent and restrained domination number denoted by respectively in the Abid-Waheed graphs and the relation between domination number, independent and restrained domination number. Also, the objective of this paper is to generate a partition dimension of.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Baghdad Science Journal MULTIDISCIPLINARY SCIENCES-

CiteScore

2.00

自引率

50.00%

发文量

102

审稿时长

24 weeks

期刊介绍： The journal publishes academic and applied papers dealing with recent topics and scientific concepts. Papers considered for publication in biology, chemistry, computer sciences, physics, and mathematics. Accepted papers will be freely downloaded by professors, researchers, instructors, students, and interested workers. ( Open Access) Published Papers are registered and indexed in the universal libraries.