enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Diameter (graph theory) - Wikipedia

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

    The degree diameter problem seeks tight relations between the diameter, number of vertices, and degree of a graph. One way of formulating it is to ask for the largest graph with given bounds on its degree and diameter. For any fixed degree, this maximum size is exponential in the diameter, with the base of the exponent depending on the degree. [1]

  3. Table of the largest known graphs of a given diameter and ...

    en.wikipedia.org/wiki/Table_of_the_largest_known...

    In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter.The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer.

  4. Circular segment - Wikipedia

    en.wikipedia.org/wiki/Circular_segment

    A circular segment (in green) is enclosed between a secant/chord (the dashed line) and the arc whose endpoints equal the chord's (the arc shown above the green area). In geometry, a circular segment or disk segment (symbol: ⌓) is a region of a disk [1] which is "cut off" from the rest of the disk by a straight line.

  5. Degree diameter problem - Wikipedia

    en.wikipedia.org/wiki/Degree_diameter_problem

    The size of G is bounded above by the Moore bound; for 1 < k and 2 < d, only the Petersen graph, the Hoffman-Singleton graph, and possibly graphs (not yet proven to exist) of diameter k = 2 and degree d = 57 attain the Moore bound. In general, the largest degree-diameter graphs are much smaller in size than the Moore bound.

  6. Area of a circle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_circle

    The area of a regular polygon is half its perimeter times the apothem. As the number of sides of the regular polygon increases, the polygon tends to a circle, and the apothem tends to the radius. This suggests that the area of a disk is half the circumference of its bounding circle times the radius. [3]

  7. Distance (graph theory) - Wikipedia

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

    A metric space defined over a set of points in terms of distances in a graph defined over the set is called a graph metric. The vertex set (of an undirected graph) and the distance function form a metric space, if and only if the graph is connected. The eccentricity ϵ(v) of a vertex v is the greatest distance between v and any other vertex; in ...

  8. Diameter (disambiguation) - Wikipedia

    en.wikipedia.org/wiki/Diameter_(disambiguation)

    Diameter (group theory), the maximum diameter of a Cayley graph of the group; Equivalent diameter, the diameter of a circle or sphere with the same area, perimeter, or volume as another object; Hydraulic diameter, the equivalent diameter of a tube or channel for fluids; Kinetic diameter, a measure of particles in a gas related to the mean free ...

  9. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    Since the diameter is twice the radius, the "missing" part of the diameter is (2r − x) in length. Using the fact that one part of one chord times the other part is equal to the same product taken along a chord intersecting the first chord, we find that (2r − x)x = (y / 2) 2. Solving for r, we find the required result.