Results 81 to 90 of about 405,795 (217)
Discrete Mathematics, 2006 Let \(S= (S_1,\dots, S_n)\) be an out-degree vector of an orientation of a graph \(G\) with vertices \(1,\dots, n\). According to the partial order \(\succeq\) on the nonnegative integral vectors [see \textit{H. J. Ryser}, J. Algebra 10, 246--261 (1968; Zbl 0167.28001)] \(S^r_G\succeq S\succeq S^l_G\), \(\sum^n_{i=1} s_i= |E(G)|\) and \(0\leq s_i\leq ...
openaire +3 more sources
The Diameter of the Minimum Spanning Tree of a Complete Graph [PDF]
, 2006 Louigi Addario‐Berry +2 more
openalex +1 more source
Temporal Ramsey Graphs: The Ramsey Kinematic Approach to the Motion of Systems of Material Points
DynamicsThe 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
MATCHING AND EDGE COVERING NUMBER ON STRONG PRODUCT OF COMPLETE BIPARTITE GRAPHS [PDF]
, 2014 Thanin Sitthiwirattham
openalex +1 more source
Linkedness of Cartesian products of complete graphs [PDF]
, 2020 Leif K. Jørgensen +2 more
openalex +1 more source
Random Graph Matching in Geometric Models: the Case of Complete Graphs [PDF]
, 2022 Haoyu Wang +3 more
openalex +1 more source
DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES [PDF]
, 2008 Jung-R. Cho, Ronald J. Gould
openalex +1 more source