Housing Watch Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Time–distance diagram - Wikipedia

    en.wikipedia.org/wiki/Timedistance_diagram

    A timedistance 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-regular graph - Wikipedia

    en.wikipedia.org/wiki/Distance-regular_graph

    In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k, and the distance between v and w . Some authors exclude the complete graphs and disconnected graphs from this definition.

  4. Distance matrix - Wikipedia

    en.wikipedia.org/wiki/Distance_matrix

    In general, a distance matrix is a weighted adjacency matrix of some graph. In a network, a directed graph with weights assigned to the arcs, the distance between two nodes of the network can be defined as the minimum of the sums of the weights on the shortest paths joining the two nodes. [2] This distance function, while well defined, is not a ...

  5. Unit distance graph - Wikipedia

    en.wikipedia.org/wiki/Unit_distance_graph

    A unit distance graph with 16 vertices and 40 edges. In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some ...

  6. Graph edit distance - Wikipedia

    en.wikipedia.org/wiki/Graph_edit_distance

    Graph edit distance. In mathematics and computer science, graph edit distance ( GED) is a measure of similarity (or dissimilarity) between two graphs . The concept of graph edit distance was first formalized mathematically by Alberto Sanfeliu and King-Sun Fu in 1983. [1] A major application of graph edit distance is in inexact graph matching ...

  7. Distance-transitive graph - Wikipedia

    en.wikipedia.org/wiki/Distance-transitive_graph

    The Biggs-Smith graph, the largest 3-regular 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.

  8. Comoving and proper distances - Wikipedia

    en.wikipedia.org/wiki/Comoving_and_proper_distances

    Comoving distance and proper distance. Comoving distance is the distance between two points measured along a path defined at the present cosmological time. For objects moving with the Hubble flow, it is deemed to remain constant in time. The comoving distance from an observer to a distant object (e.g. galaxy) can be computed by the following ...

  9. Inverse-square law - Wikipedia

    en.wikipedia.org/wiki/Inverse-square_law

    In science, an inverse-square law is any scientific law stating that the observed "intensity" of a specified physical quantity is inversely proportional to the square of the distance from the source of that physical quantity. The fundamental cause for this can be understood as geometric dilution corresponding to point-source radiation into ...