关于有向图连通性的说明

arXiv - MATH - Combinatorics Pub Date : 2024-09-18 DOI:arxiv-2409.12137

Stelios Stylianou

{"title":"关于有向图连通性的说明","authors":"Stelios Stylianou","doi":"arxiv-2409.12137","DOIUrl":null,"url":null,"abstract":"We say a directed graph $G$ on $n$ vertices is irredundant if the removal of\nany edge reduces the number of ordered pairs of distinct vertices $(u,v)$ such\nthat there exists a directed path from $u$ to $v$. We determine the maximum\npossible number of edges such a graph can have, for every $n \\in \\mathbb{N}$.\nWe also characterize the cases of equality. This resolves, in a strong form, a\nquestion of Crane and Russell.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on connectivity in directed graphs\",\"authors\":\"Stelios Stylianou\",\"doi\":\"arxiv-2409.12137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We say a directed graph $G$ on $n$ vertices is irredundant if the removal of\\nany edge reduces the number of ordered pairs of distinct vertices $(u,v)$ such\\nthat there exists a directed path from $u$ to $v$. We determine the maximum\\npossible number of edges such a graph can have, for every $n \\\\in \\\\mathbb{N}$.\\nWe also characterize the cases of equality. This resolves, in a strong form, a\\nquestion of Crane and Russell.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.12137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.12137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果删除任何一条边都会减少不同顶点$(u,v)$的有序对的数量，从而存在一条从$u$到$v$的有向路径，那么我们就说在$n$顶点上的有向图$G$是不冗余的。对于 \mathbb{N}$ 中的每一个 $n ，我们确定了这样一个图可能具有的最大边数。这就以强的形式解决了克莱恩和罗素的问题。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A note on connectivity in directed graphs

We say a directed graph $G$ on $n$ vertices is irredundant if the removal of any edge reduces the number of ordered pairs of distinct vertices $(u,v)$ such that there exists a directed path from $u$ to $v$. We determine the maximum possible number of edges such a graph can have, for every $n \in \mathbb{N}$. We also characterize the cases of equality. This resolves, in a strong form, a question of Crane and Russell.

求助全文

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

来源期刊

arXiv - MATH - Combinatorics

自引率

0.00%

发文量

期刊最新文献

A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups