Search Results for ""

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...

The involute of the circle was first studied by Huygens when he was considering clocks without pendula for use on ships at sea. He used the circle involute in his first ...

A connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A path in the complex plane over which contour integration is performed to compute a contour integral. When choosing a contour to evaluate an integral on the real line, a ...

An integral obtained by contour integration. The particular path in the complex plane used to compute the integral is called a contour. As a result of a truly amazing ...

A curtate cycloid, sometimes also called a contracted cycloid, is the path traced out by a fixed point at a radius b<a, where a is the radius of a rolling circle. Curtate ...