{"title":"半图上的简单无环图面覆盖数","authors":"W. Jinesha, D. Nidha","doi":"10.59670/jns.v35i.3562","DOIUrl":null,"url":null,"abstract":"A simple graphoidal cover of a semigraph is a graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple graphoidal cover of is called the simple graphoidal covering number of a semigraph and is denoted by . A simple acyclic graphoidal cover of a semigraph is an acyclic graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple acyclic graphoidal cover of is called the simple acyclic graphoidal covering number of a semigraph and is denoted by . In this paper we find the simple acyclic graphoidal covering number for wheel in a semigraph, unicycle in a semigraph and zero-divisor graph.","PeriodicalId":37633,"journal":{"name":"Journal of Namibian Studies","volume":"49 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Simple Acyclic Graphoidal Covering Number In A Semigraph\",\"authors\":\"W. Jinesha, D. Nidha\",\"doi\":\"10.59670/jns.v35i.3562\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple graphoidal cover of a semigraph is a graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple graphoidal cover of is called the simple graphoidal covering number of a semigraph and is denoted by . A simple acyclic graphoidal cover of a semigraph is an acyclic graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple acyclic graphoidal cover of is called the simple acyclic graphoidal covering number of a semigraph and is denoted by . In this paper we find the simple acyclic graphoidal covering number for wheel in a semigraph, unicycle in a semigraph and zero-divisor graph.\",\"PeriodicalId\":37633,\"journal\":{\"name\":\"Journal of Namibian Studies\",\"volume\":\"49 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Namibian Studies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.59670/jns.v35i.3562\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Namibian Studies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.59670/jns.v35i.3562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Arts and Humanities","Score":null,"Total":0}
引用次数: 0
摘要
半图的简单graph - like cover是这样一种graph - like cover,即图中的任意两条路径至少有一个共同的端点。的简单图形覆盖的最小基数称为半图的简单图形覆盖数,表示为。半图的简单无环图盖是这样的一种无环图盖:图中的任意两条路径几乎有一个共同的端点。的简单无环图形覆盖的最小基数称为半图的简单无环图形覆盖数,表示为。本文给出了半图中的车轮、半图中的独轮车和零因子图的简单无环图面覆盖数。
Simple Acyclic Graphoidal Covering Number In A Semigraph
A simple graphoidal cover of a semigraph is a graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple graphoidal cover of is called the simple graphoidal covering number of a semigraph and is denoted by . A simple acyclic graphoidal cover of a semigraph is an acyclic graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple acyclic graphoidal cover of is called the simple acyclic graphoidal covering number of a semigraph and is denoted by . In this paper we find the simple acyclic graphoidal covering number for wheel in a semigraph, unicycle in a semigraph and zero-divisor graph.