On Mf-Edge Colorings of Graphs

IF 0.5 4区 数学 Q3 MATHEMATICS
J. Ivanco, Alfréd Onderko
{"title":"On Mf-Edge Colorings of Graphs","authors":"J. Ivanco, Alfréd Onderko","doi":"10.7151/dmgt.2329","DOIUrl":null,"url":null,"abstract":"Abstract An edge coloring φ of a graph G is called an Mf-edge coloring if | φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v. Let 𝒦f (G) denote the maximum number of colors used in an Mf-edge coloring of G. In this paper we establish some bounds on 𝒦f(G), present some graphs achieving the bounds and determine exact values of 𝒦f(G) for some special classes of graphs.","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2329","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract An edge coloring φ of a graph G is called an Mf-edge coloring if | φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v. Let 𝒦f (G) denote the maximum number of colors used in an Mf-edge coloring of G. In this paper we establish some bounds on 𝒦f(G), present some graphs achieving the bounds and determine exact values of 𝒦f(G) for some special classes of graphs.
关于图的mf边着色
抽象一个图G的边着色φ称为Mf-edge着色如果|φ(v) |≤f (v)为每个顶点v (G),φ(v)是一组颜色的边缘事件与v和是一个分配一个正整数的函数f (v)每个顶点诉让𝒦f (G)表示的最大数量颜色用于Mf-edge着色的G .在本文中,我们建立一些界限𝒦f (G),目前一些图形实现边界和确定的确切值𝒦f (G)对某些特殊类型的图表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
22
审稿时长
53 weeks
期刊介绍: The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.
×
引用
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学术官方微信