A generalized graph planarity test is constructed for graphs with cyclic ordering of the edges incident on some of the vertices in the sought planar embedding. The results are applied to computer-aided design of computer circuits.doi:10.1007/BF01070126B. L. Shramchenko...
The Application of Graphs and Multigraphs in Cluster Analysis Godehardt,Erhard - Vieweg+Teubner Verlag 被引量: 83发表: 1988年 Light subgraphs of graphs embedded in the plane—A survey It is well known that every planar graph contains a vertex of degree at most 5. A theorem of Kotzig states...
In the existing definition of a neutrosophic planar graph, there is a limitation. In that definition, the value of falsity in degree of planarity is 1, even then the crisp underline graph is planar. This limitation is removed in the proposed definition. In this study, an advanced concept of...
In this paper, a method is presented whereby all terms of a system of equations for planar rigid body systems are calculated systematically. It is assumed that the system of rigid bodies has a topological tree structure. The method is based on a graph-theoretical approach and is consistent ...
Part of the book series:Network Theory and Applications(NETA, volume 10) Accesses About this book In the spectrum of mathematics, graph theory which studies a mathe matical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer. In recen...
The optimal planar layout of planar graphs with respect to the $L_1 $- or $L_2 $-metric leads to NP-hard problems, if one assumes the nodes of the graph to... B Becker,G Hotz - 《Siam Journal on Computing》 被引量: 55发表: 1987年 Analog circuit design space description based on...
Correlation-function identities for general planar Ising systems A system of exact algebraic relations is derived for the spin correlation functions on any so-called "boundary set" of an Ising model on an arbitrary planar graph. One way of expressing these relations is to say that every higher-...
in mice lacking key components of the planar cell polarity (PCP) pathway or beta1 integrins. In the proliferative zone of these mutants, chondrocytes fail to flatten, arrange themselves into columns, and no longer orient their short axis parallel to the P-D axis, leading to short and ...
An efficient heuristic for identifying a maximum weight planar subgraph The problem is NPComplete which justifies the use of heuristic (approximate) methods. It is shown how a new line of attack based on the graph theoretic concept of a wheel yields an efficient heuristic. An application to the...
A mixture of graph theory, nonlinear systems theory and linear algebra is relevant. We also consider a particular practical problem of flying a group of three UAVs in an equilateral triangle, with the centre of mass following a nominated trajectory reflecting constraints on turning radius, and ...