Jump to content

Draft:Lambda function (graph theory)

From Wikipedia, the free encyclopedia
  • Comment: This title and this draft are purely promotional for junk research defining and renaming binomial coefficients, a concept that has been well known for millenia. —David Eppstein (talk) 22:43, 24 March 2024 (UTC)

In a generalised form of graph theory, the lambda function of a nonnegative integer , notated as or , is equal to the exact number of links required so that there is not a single entity of entities that is not directly connected by a single link per connection to every other entity of entities. This means that it is equal to the number of edges in , the complete graph of vertices, in graph theory.

The lambda function was introduced in the 2024 generalised graph theory paper "The lambda function - computing required amounts of links to make every one of a number of entities directly linked to each other" by the mathematician Charles Ewan Milner.[1]

In his paper, Milner gives these formulas for values of the lambda function which are valid only when all the variables are nonnegative integers: , , and .

References

[edit]
  1. ^ Milner, Charles Ewan. "The lambda function - computing required amounts of links to make every one of a number of entities directly linked to each other". ResearchGate.