enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Time–distance diagram - Wikipedia

    en.wikipedia.org/wiki/Timedistance_diagram

    A time–distance diagram is a chart with two axes: one for time, the other for location. The units on either axis depend on the type of project: time can be expressed in minutes (for overnight construction of railroad modification projects such as the installation of switches) or years (for large construction projects); the location can be (kilo)meters, or other distinct units (such as ...

  3. Distance (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Distance_(graph_theory)

    The latter may occur even if the distance in the other direction between the same two vertices is defined. In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them. This is also known as the geodesic distance or shortest-path ...

  4. Shortest path problem - Wikipedia

    en.wikipedia.org/wiki/Shortest_path_problem

    Shortest path (A, C, E, D, F), blue, between vertices A and F in the weighted directed graph. In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

  5. File:Distance-time graph example.svg - Wikipedia

    en.wikipedia.org/wiki/File:Distance-time_graph...

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us

  6. Motion graphs and derivatives - Wikipedia

    en.wikipedia.org/wiki/Motion_graphs_and_derivatives

    Since the velocity of the object is the derivative of the position graph, the area under the line in the velocity vs. time graph is the displacement of the object. (Velocity is on the y-axis and time on the x-axis. Multiplying the velocity by the time, the time cancels out, and only displacement remains.)

  7. Distance-regular graph - Wikipedia

    en.wikipedia.org/wiki/Distance-regular_graph

    This graph is distance regular with intersection array {7,4,1;1,2,7} and automorphism group PGL(2,7). Some first examples of distance-regular graphs include:

  8. Distance-transitive graph - Wikipedia

    en.wikipedia.org/wiki/Distance-transitive_graph

    In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and ...

  9. Hubble's law - Wikipedia

    en.wikipedia.org/wiki/Hubble's_law

    This value is the same throughout the universe for a given comoving time. D is the proper distance (which can change over time, unlike the comoving distance, which is constant) from the galaxy to the observer, measured in mega parsecs (Mpc), in the 3-space defined by given cosmological time. (Recession velocity is just v = dD/dt).