发布求助
文献互助 智能选刊 最新文献

Electronic Journal of Graph Theory and Applications最新文献

筛选
英文 中文
Symmetric colorings of G × Z_2 G × Z_2的对称着色
Electronic Journal of Graph Theory and Applications Pub Date : 2023-10-24 DOI: 10.5614/ejgta.2023.11.2.3
Jabulani Phakathi, Yevhen Zelenyuk, Yuliya Zelenyuk
{"title":"Symmetric colorings of G × Z_2","authors":"Jabulani Phakathi, Yevhen Zelenyuk, Yuliya Zelenyuk","doi":"10.5614/ejgta.2023.11.2.3","DOIUrl":"https://doi.org/10.5614/ejgta.2023.11.2.3","url":null,"abstract":"Let G be a finite group and let r ∈ N . An r -coloring of G is any mapping χ : G → { 1 , . . . , r } . A coloring χ is symmetric if there is g ∈ G such that χ ( gx − 1 g ) = χ ( x ) for every x ∈ G . We show that if f ( r ) is the polynomial representing the number of symmetric r -colorings of G , then the number of symmetric r -colorings of G × Z 2 is f ( r 2 )","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"61 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135322963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Complete multipartite graphs of non-QE class 非qe类的完全多部图
Electronic Journal of Graph Theory and Applications Pub Date : 2023-10-24 DOI: 10.5614/ejgta.2023.11.2.14
Nobuaki Obata
{"title":"Complete multipartite graphs of non-QE class","authors":"Nobuaki Obata","doi":"10.5614/ejgta.2023.11.2.14","DOIUrl":"https://doi.org/10.5614/ejgta.2023.11.2.14","url":null,"abstract":"We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in a Euclidean space. Moreover, the primary non-QE graphs are specified among the complete multipartite graphs.","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135322948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Linear codes and cyclic codes over finite rings and their generalizations: a survey 有限环上的线性码和循环码及其推广:综述
Electronic Journal of Graph Theory and Applications Pub Date : 2023-10-24 DOI: 10.5614/ejgta.2023.11.2.11
Djoko Suprijanto
{"title":"Linear codes and cyclic codes over finite rings and their generalizations: a survey","authors":"Djoko Suprijanto","doi":"10.5614/ejgta.2023.11.2.11","DOIUrl":"https://doi.org/10.5614/ejgta.2023.11.2.11","url":null,"abstract":"We survey a recent progress of cyclic codes over finite rings and their generalization to skew cyclic as well as skew cyclic codes with derivation over finite rings, focusing on structural properties of the codes. We also report recent developments on the construction methods of linear codes from graphs, in particular strongly regular as well as distance regular graphs.","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135321969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An algebraic approach to sets defining minimal dominating sets of regular graphs 正则图的最小支配集的代数方法
Electronic Journal of Graph Theory and Applications Pub Date : 2023-10-24 DOI: 10.5614/ejgta.2023.11.2.5
Mehrdad Nasernejad
{"title":"An algebraic approach to sets defining minimal dominating sets of regular graphs","authors":"Mehrdad Nasernejad","doi":"10.5614/ejgta.2023.11.2.5","DOIUrl":"https://doi.org/10.5614/ejgta.2023.11.2.5","url":null,"abstract":"Suppose that V = {1, …, n } is a non-empty set of n elements, S = { S 1 , …, S m } a non-empty set of m non-empty subsets of V . In this paper, by using some algebraic notions in commutative algebra, we investigate the question arises whether there exists an undirected finite simple graph G with V ( G )= V , where S is the set whose elements are the minimal dominating sets of G .","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"7 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135321967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition 基于组合分解的连接图生成树和森林的枚举
IF 0.7
Electronic Journal of Graph Theory and Applications Pub Date : 2016-01-01 DOI: 10.5614/ejgta.2016.4.2.5
S. U
{"title":"Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition","authors":"S. U","doi":"10.5614/ejgta.2016.4.2.5","DOIUrl":"https://doi.org/10.5614/ejgta.2016.4.2.5","url":null,"abstract":"This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs Km +Hn and Km +Kn,p, where Hn is a graph with n isolated vertices.","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"4 1","pages":"171 - 177"},"PeriodicalIF":0.7,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70731985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信