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. Degree diameter problem - Wikipedia

    en.wikipedia.org/wiki/Degree_diameter_problem

    When the degree is less than or equal to 2 or the diameter is less than or equal to 1, the problem becomes trivial, solved by the cycle graph and complete graph respectively. In graph theory , the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V ) of diameter k such that ...

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

  5. Desmos - Wikipedia

    en.wikipedia.org/wiki/Desmos

    In it, geometrical shapes can be made, as well as expressions from the normal graphing calculator, with extra features. [8] In September 2023, Desmos released a beta for a 3D calculator, which added features on top of the 2D calculator, including cross products, partial derivatives and double-variable parametric equations.

  6. Moore graph - Wikipedia

    en.wikipedia.org/wiki/Moore_graph

    In graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the degree of such a graph is d and its diameter is k , its girth must equal 2 k + 1 .

  7. Metric dimension (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Metric_dimension_(graph...

    In graph theory, the metric dimension of a graph G is the minimum cardinality of a subset S of vertices such that all other vertices are uniquely determined by their distances to the vertices in S. Finding the metric dimension of a graph is an NP-hard problem; the decision version, determining whether the metric dimension is less than a given ...

  8. Equivalent radius - Wikipedia

    en.wikipedia.org/wiki/Equivalent_radius

    The area-equivalent radius of a 2D object is the radius of a circle with the same area as the object Cross sectional area of a trapezoidal open channel, red highlights the wetted perimeter, where water is in contact with the channel. The hydraulic diameter is the equivalent circular configuration with the same circumference as the wetted perimeter.

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