Results 1 to 10 of about 1,691,893 (274)

Temporal Ramsey Graphs: The Ramsey Kinematic Approach to the Motion of Systems of Material Points

Dynamics
The Ramsey approach is applied to analyses of the kinematics of systems built of non-relativistic, motile point masses/particles. This approach is based on colored graph theory. Point masses/particles serve as the vertices of the graph.
Edward Bormashenko
doaj   +1 more source

Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs

, 2021
A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n = 6, complete graphs K-n for n >= 3 and complete bipartite graphs K-n/2,K-n/2 for even n >= 4 have been investigated and obtained the results on balanced rank distribution number (brd(G)) for the given graphs as follows: (i) brd(L-n/2)
Hemalatha, Palanisamy, Gokilamani, S.
openaire   +1 more source

Conditional graph completions

, 1994
If G = (V,E) is a simple graph of order p and size q, and if P is a property held by G, we say that G is P-completable if there is an ordering d, e2, . . . , e(p)_g of the edges of Kv- G such that Gk = (V, E + Uf=i Ct) has property P for each k- 1,2, . . . , Q- q. The sequence {Gk} is called a P-completion sequence.
openaire   +3 more sources

Coherence as resource in scattering quantum walk search on complete graph. [PDF]

Sci Rep, 2018
Su YL, Liu SY, Wang XH, Fan H, Yang WL.
europepmc   +1 more source

Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars

AppliedMath
Graph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete ...
Robert Gardner, Kazeem Kosebinu
doaj   +1 more source

Spatial evolutionary public goods game on complete graph and dense complex networks. [PDF]

Sci Rep, 2015
Kim J, Chae H, Yook SH, Kim Y.
europepmc   +1 more source

Determining the b-chromatic number of subdivision-vertex neighbourhood coronas

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the b-chromatic number of every subdivision-vertex neighbourhood corona G ⊡ H or G ⊡ Kn, where Kn is the complete graph of order n.
Falcón Raúl M., Venkatachalam M., Julie Margaret S.   +2 more
doaj   +1 more source

Deranged perfect matchings on complete graph and balanced complete r-partite graph

Discussiones Mathematicae Graph Theory
Boqing Deng
doaj   +1 more source

Builder-Blocker Mutual-Visibility Game. [PDF]

Bull Malays Math Sci Soc
Chenoweth VI, Klavžar S, Rus G, Tan E, Tian J.   +4 more
europepmc   +1 more source

High-resolution metagenome assembly for modern long reads with myloasm. [PDF]

Nat Biotechnol
Shaw J, Marin MG, Li H.
europepmc   +1 more source