Results 241 to 250 of about 292,611 (264)
Some of the next articles are maybe not open access.

COMMON MULTIPLES OF COMPLETE GRAPHS

Proceedings of the London Mathematical Society, 2003
A graph $H$ is said to divide a graph $G$ if there exists a set $S$ of subgraphs of $G$, all isomorphic to $H$, such that the edge set of $G$ is partitioned by the edge sets of the subgraphs in $S$. Thus, a graph $G$ is a common multiple of two graphs if each of the two graphs divides $G$.
Bryant, Darryn, Maenhaut, Barbara
openaire   +1 more source

Realizing complete graphs

2017
In this chapter , we consider the DGP on a very specific class of graphs: the (K + 1)-cliques, i.e., complete graphs on K + 1 vertices, where K is the dimension of the embedding space \(\mathbb {R}^{K}\).
Leo Liberti, Carlile Lavor
openaire   +1 more source

Decomposition of complete graphs into isomorphic complete bipartite graphs

2013
Summary: A decomposition of a complete graph \(K\) into disjoint copies of a complete bipartite graph \(K_{s,t}\) is called a \(K_{s,t}\)-design of order \(n\). The existence problem of \(K_{s,t}\)-designs has been completely solved for the graphs \(K_{1,t}\) for \(k\geq 1\), \(K_{2^{a},2^{b}}\) for \(a,b\geq 1\), \(K_{2, 3}\) and \(K_{3, 3}\). In this
openaire   +2 more sources

Domination-complete graphs

Mathematical Notes of the Academy of Sciences of the USSR, 1990
See the review in Zbl 0707.05035.
openaire   +1 more source

Completely Positive Graphs

1993
The paper describes a qualitative study of completely positive matrices.
openaire   +1 more source

A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs

IEEE Transactions on Cybernetics, 2020
Lu Bai, Luca Rossi, Jian Cheng
exaly  

The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs

Discrete Mathematics, 2021
Chunqiu Fang, Ervin Győri, Jimeng Xiao
exaly  

Total edge irregularity strength of complete graphs and complete bipartite graphs

Discrete Mathematics, 2010
Stanislav Jendrol, Roman Soták
exaly  

Home - About - Disclaimer - Privacy