Search Results for ""

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

The Faulkner-Younger graphs (Faulkner and Younger 1974) are the cubic polyhedral nonhamiltonian graphs on 42 and 44 vertices illustrated above that are counterexamples to ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...