强制边和图结构。

IF 1.3 4区工程技术 Q3 INSTRUMENTS & INSTRUMENTATION

Journal of Research of the National Institute of Standards and Technology Pub Date : 2019-11-19 eCollection Date: 2019-01-01 DOI:10.6028/jres.124.022

Brian Cloteaux

{"title":"强制边和图结构。","authors":"Brian Cloteaux","doi":"10.6028/jres.124.022","DOIUrl":null,"url":null,"abstract":"For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none are define as forbidden. We examine the structure of graphs in which the degree sequences contain either forced or forbidden edges. The results include the determination of the structure of the forced or forbidden edge sets, the relationship between the sizes of forced and forbidden sets for a sequence, and the structural consequences to their realizations. This includes showing that the diameter of every realization of a degree sequence containing forced or forbidden edges is no greater than 3, and that these graphs are maximally edge-connected.","PeriodicalId":54766,"journal":{"name":"Journal of Research of the National Institute of Standards and Technology","volume":"124 ","pages":"1-9"},"PeriodicalIF":1.3000,"publicationDate":"2019-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.6028/jres.124.022","citationCount":"2","resultStr":"{\"title\":\"Forced Edges and Graph Structure.\",\"authors\":\"Brian Cloteaux\",\"doi\":\"10.6028/jres.124.022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none are define as forbidden. We examine the structure of graphs in which the degree sequences contain either forced or forbidden edges. The results include the determination of the structure of the forced or forbidden edge sets, the relationship between the sizes of forced and forbidden sets for a sequence, and the structural consequences to their realizations. This includes showing that the diameter of every realization of a degree sequence containing forced or forbidden edges is no greater than 3, and that these graphs are maximally edge-connected.\",\"PeriodicalId\":54766,\"journal\":{\"name\":\"Journal of Research of the National Institute of Standards and Technology\",\"volume\":\"124 \",\"pages\":\"1-9\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2019-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.6028/jres.124.022\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Research of the National Institute of Standards and Technology\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.6028/jres.124.022\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2019/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q3\",\"JCRName\":\"INSTRUMENTS & INSTRUMENTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Research of the National Institute of Standards and Technology","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.6028/jres.124.022","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2019/1/1 0:00:00","PubModel":"eCollection","JCR":"Q3","JCRName":"INSTRUMENTS & INSTRUMENTATION","Score":null,"Total":0}

引用次数: 2

摘要

对于一个度序列，我们将出现在该序列的每个标记实现中的边定义为强制边，而没有出现在该序列中的边定义为禁止边。我们研究了度序列包含强制边或禁止边的图的结构。结果包括确定强制或禁止边集的结构，序列的强制和禁止集的大小之间的关系，以及对其实现的结构后果。这包括表明包含强制边或禁止边的度序列的每个实现的直径不大于3，并且这些图是最大边连接的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Forced Edges and Graph Structure.

For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none are define as forbidden. We examine the structure of graphs in which the degree sequences contain either forced or forbidden edges. The results include the determination of the structure of the forced or forbidden edge sets, the relationship between the sizes of forced and forbidden sets for a sequence, and the structural consequences to their realizations. This includes showing that the diameter of every realization of a degree sequence containing forced or forbidden edges is no greater than 3, and that these graphs are maximally edge-connected.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Research of the National Institute of Standards and Technology 工程技术-物理：应用

自引率

33.30%

发文量

审稿时长

>12 weeks

期刊介绍： The Journal of Research of the National Institute of Standards and Technology is the flagship publication of the National Institute of Standards and Technology. It has been published under various titles and forms since 1904, with its roots as Scientific Papers issued as the Bulletin of the Bureau of Standards. In 1928, the Scientific Papers were combined with Technologic Papers, which reported results of investigations of material and methods of testing. This new publication was titled the Bureau of Standards Journal of Research. The Journal of Research of NIST reports NIST research and development in metrology and related fields of physical science, engineering, applied mathematics, statistics, biotechnology, information technology.