Results 281 to 290 of about 397,867 (315)
Some of the next articles are maybe not open access.
Complete graphs and complete bipartite graphs without rainbow path
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xihe Li, Ligong Wang, Xiangxiang Liu
openaire +1 more source
THE TOTAL IRREGULARITY STRENGTH OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
Far East Journal of Mathematical Sciences (FJMS), 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tilukay, M. I. +3 more
openaire +2 more sources
Decompositions of Complete Graphs
Bulletin of the London Mathematical Society, 2000Summary: If \(s_1,s_2,\dots, s_t\) are integers such that \(n-1= s_1+ s_2+\cdots+ s_t\) and such that for each \(i\) \((1\leq i\leq t)\), \(2\leq s_i\leq n-1\) and \(s_in\) is even, then \(K_n\) can be expressed as the union \(G_1\cup G_2\cup\cdots\cup G_t\) of \(t\) edge-disjoint factors, where for each \(i\), \(G_i\) is \(s_i\)-connected.
openaire +2 more sources
Nearly Completely Positive Graphs
Applicable Algebra in Engineering, Communication and Computing, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Detachments of Complete Graphs
Combinatorics, Probability and Computing, 2005A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete graph $K_n$.
openaire +2 more sources
Journal of Applied and Industrial Mathematics, 2017
Summary: We study the properties of graphs that can be placed in a rectangular lattice so that all vertices located in the same (horizontal or vertical) row be adjacent. Some criterion is formulated for an arbitrary graph to be in the specified class.
Bessonov, Yu. E., Dobrynin, A. A.
openaire +1 more source
Summary: We study the properties of graphs that can be placed in a rectangular lattice so that all vertices located in the same (horizontal or vertical) row be adjacent. Some criterion is formulated for an arbitrary graph to be in the specified class.
Bessonov, Yu. E., Dobrynin, A. A.
openaire +1 more source
Contractions to Complete Graphs
1988We survey some extremal problems concerning contraction to complete graphs, including two new theorems of the author. We also show an application to a conjecture of Las Vergnas and Meyniel.
openaire +2 more sources
1980
If G is a graph such that the deletion from G of the points in each closed neighborhood results in the complete graph K n , then we say that G is K n -residual. Similarly, if the removal of m consecutive closed neighborhoods yields K n , then G is called m-K n -residual.
Paul Erdös, Frank Harary, Maria Klawe
openaire +1 more source
If G is a graph such that the deletion from G of the points in each closed neighborhood results in the complete graph K n , then we say that G is K n -residual. Similarly, if the removal of m consecutive closed neighborhoods yields K n , then G is called m-K n -residual.
Paul Erdös, Frank Harary, Maria Klawe
openaire +1 more source
COMMON MULTIPLES OF COMPLETE GRAPHS
Proceedings of the London Mathematical Society, 2003A 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
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
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