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

Journal of Combinatorial Mathematics and Combinatorial Computing最新文献

筛选
英文 中文
Cycles and Paths Related Vertex-Equitable Graphs 环与路径相关的点公平图
Journal of Combinatorial Mathematics and Combinatorial Computing Pub Date : 2023-08-01 DOI: 10.61091/jcmcc117-02
S. Nazeer, Najma Sultana, E. Bonyah
{"title":"Cycles and Paths Related Vertex-Equitable Graphs","authors":"S. Nazeer, Najma Sultana, E. Bonyah","doi":"10.61091/jcmcc117-02","DOIUrl":"https://doi.org/10.61091/jcmcc117-02","url":null,"abstract":"A vertex labeling (xi) of a graph (chi) is referred to as a 'vertex equitable labeling (VEq.)' if the induced edge weights, obtained by summing the labels of the end vertices, satisfy the following condition: the absolute difference in the number of vertices (v) and (u) with labels (xi(v)= a) and (xi(u)= b) (where (a, bin Z)) is approximately (1), considering a given set (A) that consists of the first (lceil frac{q}{2} rceil) non-negative integers. A graph $chi$ that admits a vertex equitable labeling (VEq.) is termed a 'vertex equitable' graph. In this manuscript, we have demonstrated that graphs related to cycles and paths are examples of vertex-equitable graphs.","PeriodicalId":39040,"journal":{"name":"Journal of Combinatorial Mathematics and Combinatorial Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44295034","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
Study of Topological Behavior of Some Computer Related Graphs 一些计算机相关图的拓扑行为研究
Journal of Combinatorial Mathematics and Combinatorial Computing Pub Date : 2023-08-01 DOI: 10.61091/jcmcc117-01
Xiaohui Ren, I. Ahmed, Rui Liu
{"title":"Study of Topological Behavior of Some Computer Related Graphs","authors":"Xiaohui Ren, I. Ahmed, Rui Liu","doi":"10.61091/jcmcc117-01","DOIUrl":"https://doi.org/10.61091/jcmcc117-01","url":null,"abstract":"Network theory is the study of graphs such as representing equilibrium relationships or unequal relationships between different objects. A network can be defined as a graph where nodes and / or margins have attributes (e.g. words). Topological index of a graph is a number that helps to understand its topology and a topological index is known as irregularity index if it is greater than zero and topological index of graph is equal to zero if and only if graph is regular. The irregularity indices are used for computational analysis of nonregular graph topological composition. In this paper, we aim to compute topological invariants of some computer related graph networks. We computed various irregularities indices for the graphs of OTIS swapped network (OP_a) and Biswapped Networks (Bsw(Pa).)","PeriodicalId":39040,"journal":{"name":"Journal of Combinatorial Mathematics and Combinatorial Computing","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44445007","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学术官方微信