Search Results for ""

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

A convex figure constructed by iteratively halving the base of an equilateral triangle and then sliding adjacent triangles so that they slightly overlap. Combining several ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

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 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 ...

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 ...

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 ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

A differential of the form df=P(x,y)dx+Q(x,y)dy (1) is exact (also called a total differential) if intdf is path-independent. This will be true if ...

A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...