Search Results for ""

An antiprism graph is a graph corresponding to the skeleton of an antiprism. Antiprism graphs are therefore polyhedral and planar. The n-antiprism graph has 2n vertices and ...

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

A portion of a disk whose upper boundary is a (circular) arc and whose lower boundary is a chord making a central angle theta<pi radians (180 degrees), illustrated above as ...

A cubic curve invented by Diocles in about 180 BC in connection with his attempt to duplicate the cube by geometrical methods. The name "cissoid" first appears in the work of ...

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...