车轮的顶点边支配集和顶点边支配多项式

International Journal of Mathematical Archive Pub Date : 2014-10-31 DOI:10.6084/M9.FIGSHARE.1224161

A. Vijayan, T. Nagarajan

{"title":"车轮的顶点边支配集和顶点边支配多项式","authors":"A. Vijayan, T. Nagarajan","doi":"10.6084/M9.FIGSHARE.1224161","DOIUrl":null,"url":null,"abstract":"Let G = (V, E) be a simple Graph. A set S  V(G) is a vertex-edge dominating set (or simply ve-dominating set) if for all edges e  E(G), there exist a vertex v  S such that v dominates e. In this paper, we study the concept of vertex-edge domination polynomial of the cycle Cn. The vertex-edge domination polynomial of Cn is Dve(Cn, x) = |V(G)|","PeriodicalId":161718,"journal":{"name":"International Journal of Mathematical Archive","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Vertex- Edge Dominating Sets and Vertex-Edge Domination Polynomials of Wheels\",\"authors\":\"A. Vijayan, T. Nagarajan\",\"doi\":\"10.6084/M9.FIGSHARE.1224161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V, E) be a simple Graph. A set S  V(G) is a vertex-edge dominating set (or simply ve-dominating set) if for all edges e  E(G), there exist a vertex v  S such that v dominates e. In this paper, we study the concept of vertex-edge domination polynomial of the cycle Cn. The vertex-edge domination polynomial of Cn is Dve(Cn, x) = |V(G)|\",\"PeriodicalId\":161718,\"journal\":{\"name\":\"International Journal of Mathematical Archive\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Mathematical Archive\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.6084/M9.FIGSHARE.1224161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mathematical Archive","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6084/M9.FIGSHARE.1224161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

设G = (V, E)是一个简单图。如果对于所有边ee (G)，存在一个顶点VS使得V优于e，则集合SV(G)是一个顶点-边控制集(或简单地说，是-控制集)。本文研究了循环Cn的顶点-边控制多项式的概念。Cn的顶点边支配多项式为Dve(Cn, x) = |V(G)|

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

查看原文本刊更多论文

Vertex- Edge Dominating Sets and Vertex-Edge Domination Polynomials of Wheels

Let G = (V, E) be a simple Graph. A set S  V(G) is a vertex-edge dominating set (or simply ve-dominating set) if for all edges e  E(G), there exist a vertex v  S such that v dominates e. In this paper, we study the concept of vertex-edge domination polynomial of the cycle Cn. The vertex-edge domination polynomial of Cn is Dve(Cn, x) = |V(G)|

求助全文

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

来源期刊

International Journal of Mathematical Archive

自引率

0.00%

发文量