Results 1 to 10 of about 24,599 (177)
Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
Моделирование и анализ информационных систем, 2015 We provide an effective description of graphs of polyhedra for GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH problems. We establish the fact, that the clique number for each of this problems increases exponentially with the dimension of the space.
A. I. Antonov, V. A. Bondarenko
doaj +5 more sources
Eigensharp graphs: decomposition into complete bipartite subgraphs [PDF]
Transactions of the American Mathematical Society, 1988 Let τ ( G ) \tau (G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G G , and let r ( G ) r(G) be the larger of the number of positive and number of negative eigenvalues of G G . It is
Kratzke, Thomas +2 more
openaire +2 more sources
On Subgraphs of the Complete Bipartite Graph [PDF]
Canadian Mathematical Bulletin, 1964 G(n) denotes a graph of n vertices and Ḡ(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let Ck(G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k1where the minimum is over all graphs G(n).
Erdős, Pál, Moon, J. W.
openaire +2 more sources
On vertex stability of complete k-partite graphs [PDF]
Opuscula Mathematica, 2015 Let \(H\) be any graph. We say that graph \(G\) is \(H\)-stable if \(G-u\) contains a subgraph isomorphic to \(H\) for an arbitrary chosen \(u\in V(G)\).
Mateusz Nikodem
doaj +1 more source
P_4-Colorings and P_4-Bipartite Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V_is is said to be a P_4-free coloring if each color class V_i induces a subgraph without chordless path on four vertices (denoted by P_4).
Chinh T. Hoàng, Van Bang Le
doaj +1 more source
Independent 2-point set domination in graphs - II
AKCE International Journal of Graphs and Combinatorics, 2022 A set D of vertices in a connected graph G is said to be an independent 2-point set dominating set (or in short i-2psd set) of G if D is an independent set and for every non-empty subset [Formula: see text] there exists a non-empty subset [Formula: see ...
Deepti Jain, Purnima Gupta
doaj +1 more source
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs [PDF]
The Electronic Journal of Combinatorics, 2016 It is shown that if $G$ is any bipartite 2-regular graph of order at most $n/2$ or at least $n-2$, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order $n$ into a perfect matching and edge-disjoint copies of $G$.
Bryant, Darryn +2 more
openaire +3 more sources
Induced subgraph and eigenvalues of some signed graphs
AKCE International Journal of Graphs and Combinatorics, 2022 Hao Huang proved the Sensitivity Conjecture in [Induced graphs of the hypercube and a proof of the Sensitivity Conjecture, Annals of Mathematics, 190 (2019), 949-955] by signed graph spectral method.
Fu-Tao Hu, Mei-Yu Sun
doaj +1 more source
Anti-Ramsey theory on complete bipartite graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho +3 more
doaj +1 more source
Hop total Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 In this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists ...
H. Abdollahzadeh Ahangar +3 more
doaj +1 more source