TOPICS
Search

Search Results for ""


221 - 230 of 1536 for Small-World Network Average PathSearch Results
"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...
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 ...
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 ...
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 ...
The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...
1 ... 20|21|22|23|24|25|26 ... 154 Previous Next

...