V-SUPER VERTEX OUT-MAGIC TOTAL LABELINGS OF DIGRAPHS

Pub Date : 2017-04-30 DOI:10.4134/CKMS.C150189
G. D. Devi, M. Durga, G. Marimuthu
{"title":"V-SUPER VERTEX OUT-MAGIC TOTAL LABELINGS OF DIGRAPHS","authors":"G. D. Devi, M. Durga, G. Marimuthu","doi":"10.4134/CKMS.C150189","DOIUrl":null,"url":null,"abstract":"Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from V (D) ∪ A(D) −→ {1, 2, . . ., p + q} with the property that for every v ∈ V (D), f(v) + ∑ u∈O(v) f((v, u)) = k, for some constant k. Such a labeling is called a V super vertex outmagic total labeling (V -SVOMT labeling) if f(V (D)) = {1, 2, 3, . . . , p}. A digraph D is called a V -super vertex out-magic total digraph (V -SVOMT digraph) if D admits a V -SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V -SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies. 1. Background A labeling of a graph G is a mapping that carries a set of graph elements, usually the vertices and edges into a set of numbers, usually integers. We deal with digraphs which possibly admit self-loops but not multiple arcs. For standard graph theory terminology we follow [6]. Specifically, let D = (V,A) be a digraph with vertex set V and arc set A. If (u, v) ∈ A, then there is an arc from u to v and u is called a head, v is called a tail. If (u, u) ∈ A, the arc (u, u) is called a self-loop or loop. For a vertex v ∈ V, the sets O(v) = {u | (v, u) ∈ A} and I(v) = {u | (u, v) ∈ A} are called the out-neighborhood and the inneighborhood of the vertex v, respectively. The out-degree and in-degree of v are deg(v) = |O(v)| and deg(v) = |I(v)|, respectively. MacDougall et al. [12, 15] introduced the notion of vertex magic total labeling. If G is a finite simple undirected graph with p vertices and q edges, then a vertex magic total labeling is a bijection f from V (G) ∪ E(G) to the integers 1, 2, . . . , p + q with the property that for every u in V (G), f(u) + Received October 20, 2015. 2010 Mathematics Subject Classification. Primary 05C78.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4134/CKMS.C150189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from V (D) ∪ A(D) −→ {1, 2, . . ., p + q} with the property that for every v ∈ V (D), f(v) + ∑ u∈O(v) f((v, u)) = k, for some constant k. Such a labeling is called a V super vertex outmagic total labeling (V -SVOMT labeling) if f(V (D)) = {1, 2, 3, . . . , p}. A digraph D is called a V -super vertex out-magic total digraph (V -SVOMT digraph) if D admits a V -SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V -SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies. 1. Background A labeling of a graph G is a mapping that carries a set of graph elements, usually the vertices and edges into a set of numbers, usually integers. We deal with digraphs which possibly admit self-loops but not multiple arcs. For standard graph theory terminology we follow [6]. Specifically, let D = (V,A) be a digraph with vertex set V and arc set A. If (u, v) ∈ A, then there is an arc from u to v and u is called a head, v is called a tail. If (u, u) ∈ A, the arc (u, u) is called a self-loop or loop. For a vertex v ∈ V, the sets O(v) = {u | (v, u) ∈ A} and I(v) = {u | (u, v) ∈ A} are called the out-neighborhood and the inneighborhood of the vertex v, respectively. The out-degree and in-degree of v are deg(v) = |O(v)| and deg(v) = |I(v)|, respectively. MacDougall et al. [12, 15] introduced the notion of vertex magic total labeling. If G is a finite simple undirected graph with p vertices and q edges, then a vertex magic total labeling is a bijection f from V (G) ∪ E(G) to the integers 1, 2, . . . , p + q with the property that for every u in V (G), f(u) + Received October 20, 2015. 2010 Mathematics Subject Classification. Primary 05C78.
分享
查看原文
有向图的V-超顶点OUT-MAGIC全标号
设D是一个有p个顶点和q条弧的有向图。一个顶点out-magic全标记是一个来自V (D)的双射∪A(D)−→{1,2,…,p + q},它具有这样的性质:对于每一个V∈V (D), f(V, u) +∑u∈O(V) f((V, u)) = k,对于某常数k,这样的标记称为V超顶点out-magic全标记(V -SVOMT标记),如果f(V (D)) ={1,2,3,…, p}。如果有向图D允许V -SVOMT标记,则称为V -超顶点外魔幻总有向图D (V -SVOMT有向图)。本文通过引入有向图的标注,给出了一种寻找网络中最重要节点的方法,并研究了有向图的标注的基本性质。特别是,我们彻底解决了互连网络拓扑中使用的广义de Bruijn有向图的V -SVOMT标记问题。1. 图G的标记是一种映射,它携带一组图元素,通常是顶点和边到一组数字,通常是整数。我们处理的有向图可能包含自环,但不包含多重弧。对于标准图论术语,我们遵循[6]。具体地说,设D = (V,A)是一个有向图,其顶点集V和弧集A。如果(u, V)∈A,则u到V之间存在一条弧,u称为头,V称为尾。如果(u, u)∈A,则弧(u, u)称为自环或环。对于顶点v∈v,集合O(v) = {u | (v, u)∈a}和集合I(v) = {u | (u, v)∈a}分别称为顶点v的外邻域和内邻域。v的出度和入度分别为deg(v) = |O(v)|和deg(v) = |I(v)|。MacDougall等人[12,15]引入了顶点魔幻全标记的概念。如果G是一个有p个顶点和q条边的有限简单无向图,那么顶点魔幻全标记就是从V (G)∪E(G)到整数1,2,…的二射。, p + q的性质是,对于V (G)中的每一个u, f(u) +收到2015年10月20日。2010年数学学科分类。主要05 c78。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信