Search Results for ""

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...

The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), ...

The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

Coaxal circles are circles whose centers are collinear and that share a common radical line. The collection of all coaxal circles is called a pencil of coaxal circles ...

Given a curve C and O=(x_0,y_0) a fixed point called the pedal point, then for a point P on C, draw a line perpendicular to OP. The envelope of these lines as P describes the ...