The Angles and Main Angles of Some Special Graphs
نویسندگان
چکیده
منابع مشابه
Crossing Angles of Geometric Graphs
We study the crossing angles of geometric graphs in the plane. We introduce the crossing angle number of a graph G, denoted can(G), which is the minimum number of angles between crossing edges in a straight-line drawing of G. We show that an n-vertex graph G with can(G) = O(1) has O(n) edges, but there are graphs G with bounded degree and arbitrarily large can(G). We also initiate the study of ...
متن کاملOn Angles and Perturbations of Graphs
We consider only finite undirected graphs without loops or multiple edges. Let G be a non-trivial connected graph whose vertices are labelled 1,2,..., n and let A be the corresponding (0, l)-adjacency matrix of G. Let A have spectral form to Px + . . . + fim Pm where to > ... > //m: the largest eigenvalue nx is called the index of G. For ie ( 1 , . . . , m) andye {1,...,«}, let cos" (ay) be the...
متن کامل[Angles among main cranial sutures in Japanese].
To examine a relation of angles among the coronal, sagittal and lambdoid sutures to the size of the calvaria as well as to the remains of the metopic suture, 158 adult Japanese calvae or calottes were observed. The calvae used consisted of four groups: group M composed of 74 male calvae without the metopic suture; group F, of 41 female calvae without the same suture; group Un, of 27 sex-unknown...
متن کاملGait Recognition Using Joint Moments, Joint Angles and Segment Angles
INTRODUCTION Recognition of gait patterns has been studied intensively during the last decades. Different gait strategies have been elucidated by applying different waveform analysis techniques to biomechanical gait data [1,2] and it has been shown that individuals can be identified using joint angles in the sagittal plane [3]. However, little is known about additional biomechanical variables f...
متن کاملAn algorithm for constructing graphs with given eigenvalues and angles
Let the eigenvalues of a graph and the angles between eigenspaces and the co-ordinate axes of the corresponding real vector space be given for a graph. Cvetković [2] gave a method of constructing a graph which is the supergraph of all graphs with given eigenvalues and angles. Based on this, we describe a branch & bound algorithm for constructing all graphs with given eigenvalues and angles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2020
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2020.116035