Extremal families of redundantly rigid graphs in three dimensions

被引：1

作者：

Jordan, Tibor ^{[1
,2
]}

Poston, Christopher ^{[3
]}

Roach, Ryan ^{[4
]}

机构：

[1] Eotvos Lorand Univ, Dept Operat Res, Pazmany Peter setany 1 C, H-1117 Budapest, Hungary

[2] MTA ELTE Egervary Res Grp Combinatorial Optimizat, Pazmany Peter setany 1 C, H-1117 Budapest, Hungary

[3] Yale Univ, Dept Math, New Haven, CT USA

[4] Washington Univ, Dept Math & Stat, St Louis, MO USA

来源：

DISCRETE APPLIED MATHEMATICS | 2022年 / 322卷

基金：

匈牙利科学研究基金会;

关键词：

Rigid graph; Globally rigid graph; Redundant rigidity; Block and hole graph; Rigid framework;

D O I：

10.1016/j.dam.2022.03.006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A rigid graph G is said to be k-vertex (resp. k-edge) rigid in Rd if it remains rigid after the removal of less than k vertices (resp. edges). The definition of k-vertex (resp. k-edge) globally rigid graphs in Rd is similar. We study each of these four versions of redundant (global) rigidity and determine the smallest number of edges in a k-vertex (resp. k-edge) rigid (resp. globally rigid) graph on n vertices in R3 for all positive integers k, except for four special cases, where we provide a close-to-tight bound.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

引用

页码：448 / 464

页数：17

共 50 条

[21] Drawing graphs symmetrically in three dimensions
Hong, SH
GRAPH DRAWING, 2002, 2265 : 189 - 204
[22] Geodesics in graphs, an extremal set problem, anti perfect hash families
Atici, M
Vince, AA
GRAPHS AND COMBINATORICS, 2002, 18 (03) : 403 - 413
[23] Domination game: Extremal families of graphs for 3/5-conjectures
Bresar, Bostjan
Klavzar, Sandi
Kosmrlj, Gasper
Rallc, Douglas F.
DISCRETE APPLIED MATHEMATICS, 2013, 161 (10-11) : 1308 - 1316
[24] An Approach to the Extremal Inverse Degree Index for Families of Graphs with Transformation Effect
Asif, Muhammad
Hussain, Muhammad
Almohamedh, Hamad
Alhamed, Khalid M.
Almotairi, Sultan
JOURNAL OF CHEMISTRY, 2021, 2021
[25] Extremal Graphs with Respect to Vertex Betweenness Centrality for Certain Graph Families
Klisara, Jelena
Hurajova, Jana Coronicova
Madaras, Tomas
Skrekovski, Riste
FILOMAT, 2016, 30 (11) : 3123 - 3130
[26] On adjoint uniqueness of three families of graphs
Dalian Ligong Daxue Xuebao, 2 (134):
[27] Redundantly globally rigid braced triangulations
Chen, Qianfan
Jajodia, Siddhant
Jordan, Tibor
Perkins, Kate
ARS MATHEMATICA CONTEMPORANEA, 2024, 24 (01)
[28] The (n,n)-graphs with the first three extremal Wiener indices
Tang, Zikai
Deng, Hanyuan
JOURNAL OF MATHEMATICAL CHEMISTRY, 2008, 43 (01) : 60 - 74
[29] The (n,n)-graphs with the first three extremal Wiener indices
Zikai Tang
Hanyuan Deng
Journal of Mathematical Chemistry, 2008, 43 : 60 - 74
[30] Hierarchical layouts of directed graphs in three dimensions
Hong, SH
Nikolov, NS
GRAPH DRAWING, 2006, 3843 : 251 - 261

← 1 2 3 4 5 →