Realizability of Graphs

被引：0

作者：

Maria Belk

Robert Connelly

机构：

[1] Department of Mathematics,

[2] Texas A&M University,undefined

[3] Department of Mathematics,undefined

[4] Cornell University,undefined

来源：

Discrete & Computational Geometry | 2007年 / 37卷

关键词：

Edge Length; Discrete Comput Geom; Weighted Graph; Adjacent Vertex; Tree Decomposition;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A graph is d-realizable if, for every configuration of its vertices in EN, there exists a another corresponding configuration in Ed with the same edge lengths. A graph is 2-realizable if and only if it is a partial 2-tree, i.e., a subgraph of the 2-sum of triangles in the sense of graph theory. We show that a graph is 3-realizable if and only if it does not have K5 or the 1-skeleton of the octahedron as a minor.

引用

页码：125 / 137

页数：12

共 50 条

[1] REALIZABILITY AND UNIQUENESS IN GRAPHS
AIGNER, M
TRIESCH, E
[J]. DISCRETE MATHEMATICS, 1994, 136 (1-3) : 3 - 20
[2] NOTE ON REALIZABILITY OF DIRECTED GRAPHS
SESHU, S
[J]. IRE TRANSACTIONS ON CIRCUIT THEORY, 1962, CT 9 (04): : 412 - &
[3] Realizability of graphs as triangle cover contact graphs
Sultana, Shaheena
Rahman, Md. Saidur
[J]. THEORETICAL COMPUTER SCIENCE, 2018, 720 : 24 - 35
[4] Realizability and verification of MSC graphs
Alur, R
Etessami, K
Yannakakis, M
[J]. AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 797 - 808
[5] REALIZABILITY PROBLEM FOR COMMUTING GRAPHS
Giudici, Michael
Kuzma, Bojan
[J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2016, 101 (03) : 335 - 355
[6] Realizability of graphs in three dimensions
Belk, Maria
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2007, 37 (02) : 139 - 162
[7] On rigidity and realizability of weighted graphs
Alfakih, AY
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 325 (1-3) : 57 - 70
[8] Realizability of Fault-Tolerant Graphs
Yanmei Hong
[J]. Bulletin of the Malaysian Mathematical Sciences Society, 2016, 39 : 619 - 631
[9] Realizability of Fault-Tolerant Graphs
Hong, Yanmei
[J]. BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2016, 39 (02) : 619 - 631
[10] Edge Realizability of Connected Simple Graphs
Hansen, Pierre
Hertz, Alain
Sellal, Cherif
VukieeviC, Damir
Aouchichel, Mustapha
Caporossil, Gilles
[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2017, 78 (03) : 689 - 712

← 1 2 3 4 5 →