For a graph (G) and a positive integer (k), a royal (k)-edge coloring of (G) is an assignment of nonempty subsets of the set ({1, 2, ldots, k}) to the edges of (G) that gives rise to a proper vertex coloring in which the color assigned to each vertex (v) is the union of the sets of colors of the edges incident with (v). If the resulting vertex coloring is vertex-distinguishing, then the edge coloring is a strong royal (k)-coloring. The minimum positive integer (k) for which a graph has a strong royal (k)-coloring is the strong royal index of the graph. The primary emphasis here is on strong royal colorings of trees.
{"title":"Royal Colorings of Graphs","authors":"G. Chartrand, James Hallas, Ping Zhang","doi":"10.61091/ars156-06","DOIUrl":"https://doi.org/10.61091/ars156-06","url":null,"abstract":"For a graph (G) and a positive integer (k), a royal (k)-edge coloring of (G) is an assignment of nonempty subsets of the set ({1, 2, ldots, k}) to the edges of (G) that gives rise to a proper vertex coloring in which the color assigned to each vertex (v) is the union of the sets of colors of the edges incident with (v). If the resulting vertex coloring is vertex-distinguishing, then the edge coloring is a strong royal (k)-coloring. The minimum positive integer (k) for which a graph has a strong royal (k)-coloring is the strong royal index of the graph. The primary emphasis here is on strong royal colorings of trees.","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41337596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jagannathan M, Vernold Vivin J, Veninstine Vivik J
The coloring of all the edges of a graph (G) with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of (W_n), (DW_n) and (G_n) by determining its edge chromatic number.
{"title":"Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs","authors":"Jagannathan M, Vernold Vivin J, Veninstine Vivik J","doi":"10.61091/ars156-05","DOIUrl":"https://doi.org/10.61091/ars156-05","url":null,"abstract":"The coloring of all the edges of a graph (G) with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of (W_n), (DW_n) and (G_n) by determining its edge chromatic number.","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47182237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Let us consider a~simple connected undirected graph (G=(V,E)). For a~graph (G) we define a~(k)-labeling (phi: V(G)to {1,2, dots, k}) to be a~distance irregular vertex (k)-labeling of the graph (G) if for every two different vertices (u) and (v) of (G), one has (wt(u) ne wt(v),) where the weight of a~vertex (u) in the labeling (phi) is (wt(u)=sumlimits_{vin N(u)}phi(v),) where (N(u)) is the set of neighbors of (u). The minimum (k) for which the graph (G) has a~distance irregular vertex (k)-labeling is known as distance irregularity strength of (G,) it is denoted as (dis(G)). In this paper, we determine the exact value of the distance irregularity strength of corona product of cycle and path with complete graph of order (1,) friendship graph, Jahangir graph and helm graph. For future research, we suggest some open problems for researchers of the same domain of study.
让我们考虑一个简单连通无向图(G=(V,E))。对于图(G)，我们定义(k) -标记(phi: V(G)to {1,2, dots, k})为距离不规则顶点(k) -标记(G)，如果对于(G)的每两个不同的顶点(u)和(v)，有(wt(u) ne wt(v),)其中标记(phi)中的顶点(u)的权值为(wt(u)=sumlimits_{vin N(u)}phi(v),)其中(N(u))是(u)的邻居集。图(G)具有距离不规则顶点(k)标记的最小(k)称为距离不规则强度(G,)，表示为(dis(G))。本文用完全阶图(1,)友情图、贾汉吉尔图和赫尔姆图确定了环径电晕积距离不规则强度的精确值。对于未来的研究，我们提出了一些对同一研究领域的研究人员开放的问题。
{"title":"A Note on Distance Irregular Labeling of Graphs","authors":"A. Ahmad","doi":"10.61091/ars156-04","DOIUrl":"https://doi.org/10.61091/ars156-04","url":null,"abstract":"Let us consider a~simple connected undirected graph (G=(V,E)). For a~graph (G) we define a~(k)-labeling (phi: V(G)to {1,2, dots, k}) to be a~distance irregular vertex (k)-labeling of the graph (G) if for every two different vertices (u) and (v) of (G), one has (wt(u) ne wt(v),) where the weight of a~vertex (u) in the labeling (phi) is (wt(u)=sumlimits_{vin N(u)}phi(v),) where (N(u)) is the set of neighbors of (u). The minimum (k) for which the graph (G) has a~distance irregular vertex (k)-labeling is known as distance irregularity strength of (G,) it is denoted as (dis(G)). In this paper, we determine the exact value of the distance irregularity strength of corona product of cycle and path with complete graph of order (1,) friendship graph, Jahangir graph and helm graph. For future research, we suggest some open problems for researchers of the same domain of study.","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43023091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An antipodal labeling is a function (f )from the vertices of (G) to the set of natural numbers such that it satisfies the condition (d(u,v) + left| f(u) - f(v) right| geq d), where d is the diameter of (G )and (d(u,v)) is the shortest distance between every pair of distinct vertices (u) and (v) of (G.) The span of an antipodal labeling (f )is (sp(f) = max{|f(u) - f (v)|:u, v, in , V(G)}.) The antipodal number of~G, denoted by~an(G), is the minimum span of all antipodal labeling of~G. In this paper, we determine the antipodal number of Mongolian tent and Torus grid.
{"title":"Radio Antipodal Labeling of Mongolian Tent and Torus Grid Graphs","authors":"S. Gomathi, P. Venugopal, T. Jose","doi":"10.61091/ars156-01","DOIUrl":"https://doi.org/10.61091/ars156-01","url":null,"abstract":"An antipodal labeling is a function (f )from the vertices of (G) to the set of natural numbers such that it satisfies the condition (d(u,v) + left| f(u) - f(v) right| geq d), where d is the diameter of (G )and (d(u,v)) is the shortest distance between every pair of distinct vertices (u) and (v) of (G.) The span of an antipodal labeling (f )is (sp(f) = max{|f(u) - f (v)|:u, v, in , V(G)}.) The antipodal number of~G, denoted by~an(G), is the minimum span of all antipodal labeling of~G. In this paper, we determine the antipodal number of Mongolian tent and Torus grid.","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45809981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Let (G) be a simple connected graph with vertex set (V) and diameter (d). An injective function (c: Vrightarrow {1,2,3,ldots}) is called a {radio labeling} of (G) if ({|c(x)-c(y)|+d(x,y)geq d+1}) for all distinct (x,yin V), where (d(x,y)) is the distance between vertices (x) and (y). The largest number in the range of (c) is called the span of the labeling (c). The radio number of (G) is the minimum span taken over all radio labelings of (G). For a fixed vertex (z) of (G), the sequence ((l_1,l_2,ldots,l_r)) is called the level tuple of (G), where (l_i) is the number of vertices whose distance from (z) is (i). Let (J^k(l_1,l_2,ldots,l_r)) be the wedge sum (i.e., one vertex union) of (kgeq2) graphs having same level tuple ((l_1,l_2,ldots,l_r)). Let (Jleft(frac{l_1}{l'_1},frac{l_2}{l'_2},ldots,frac{l_r}{l'_r}right)) be the wedge sum of two graphs of same order, having level tuples ((l_1,l_2,ldots,l_r)) and ((l'_1,l'_2,ldots,l'_r)). In this paper, we compute the radio number for some sub-families of (J^k(l_1,l_2,ldots,l_r)) and (Jleft(frac{l_1}{l'_1},frac{l_2}{l'_2},ldots,frac{l_r}{l'_r}right)).
{"title":"Further Results on Radio Number of Wedge sum of Graphs","authors":"Asim Naseem, K. Shabbir, M. Ramzan","doi":"10.61091/ars156-02","DOIUrl":"https://doi.org/10.61091/ars156-02","url":null,"abstract":"Let (G) be a simple connected graph with vertex set (V) and diameter (d). An injective function (c: Vrightarrow {1,2,3,ldots}) is called a {radio labeling} of (G) if ({|c(x)-c(y)|+d(x,y)geq d+1}) for all distinct (x,yin V), where (d(x,y)) is the distance between vertices (x) and (y). The largest number in the range of (c) is called the span of the labeling (c). The radio number of (G) is the minimum span taken over all radio labelings of (G). For a fixed vertex (z) of (G), the sequence ((l_1,l_2,ldots,l_r)) is called the level tuple of (G), where (l_i) is the number of vertices whose distance from (z) is (i). Let (J^k(l_1,l_2,ldots,l_r)) be the wedge sum (i.e., one vertex union) of (kgeq2) graphs having same level tuple ((l_1,l_2,ldots,l_r)). Let (Jleft(frac{l_1}{l'_1},frac{l_2}{l'_2},ldots,frac{l_r}{l'_r}right)) be the wedge sum of two graphs of same order, having level tuples ((l_1,l_2,ldots,l_r)) and ((l'_1,l'_2,ldots,l'_r)). In this paper, we compute the radio number for some sub-families of (J^k(l_1,l_2,ldots,l_r)) and (Jleft(frac{l_1}{l'_1},frac{l_2}{l'_2},ldots,frac{l_r}{l'_r}right)).","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44811292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Muhammad Junaid Ali Junjua, K. Shabbir, Asim Naseem
Elimination ideals are monomial ideals associated to simple graphs, not necessarily square--free, was introduced by Anwar and Khalid. These ideals are Borel type. In this paper, we obtain sharp combinatorial upper bounds of the Castelnuovo--Mumford regularity of elimination ideals corresponding to certain family of graphs.
{"title":"ombinatorial Bounds of the Regularity of Elimination Ideals","authors":"Muhammad Junaid Ali Junjua, K. Shabbir, Asim Naseem","doi":"10.61091/ars156-03","DOIUrl":"https://doi.org/10.61091/ars156-03","url":null,"abstract":"Elimination ideals are monomial ideals associated to simple graphs, not necessarily square--free, was introduced by Anwar and Khalid. These ideals are Borel type. In this paper, we obtain sharp combinatorial upper bounds of the Castelnuovo--Mumford regularity of elimination ideals corresponding to certain family of graphs.","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49384841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：