Results 11 to 20 of about 143,400 (232)
Complete graphs and complete bipartite graphs without rainbow path
Discrete Mathematics, 2019 Motivated by Ramsey-type questions, we consider edge-colorings of complete graphs and complete bipartite graphs without rainbow path. Given two graphs G and H , the k -colored Gallai–Ramsey number g r k ( G : H ) is defined to be the minimum integer n ...
Xihe Li, Ligong Wang, Xiangxiang Liu
semanticscholar +4 more sources
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
Ain Shams Engineering Journal, 2015 Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding ...
S. El-Serafi +2 more
doaj +3 more sources
Decomposition of complete bipartite graphs into cycles and stars with four edges
AKCE International Journal of Graphs and Combinatorics, 2020 Let Ck, Sk denote a cycle, star with k edges and let Km,n denotes a complete bipartite graph with m and n vertices in the parts. In this paper, we obtain necessary and sufficient conditions for the existence of a decomposition of complete bipartite ...
M. Ilayaraja, A. Muthusamy
doaj +2 more sources
Topological Drawings of Complete Bipartite Graphs [PDF]
International Symposium Graph Drawing and Network Visualization, 2016 Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points.
J. Cardinal, S. Felsner
semanticscholar +4 more sources
Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search [PDF]
EntropyQuantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently.
Renato Portugal, Jalil Khatibi Moqadam
doaj +2 more sources
Universal Rigidity of Complete Bipartite Graphs [PDF]
Discrete & Computational Geometry, 2015 We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework (K(n,m),p,q)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage ...
R. Connelly, S. Gortler
semanticscholar +4 more sources
Interval minors of complete bipartite graphs [PDF]
Journal of Graph Theory, 2014 Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in $K_{r,s}$-interval minor free bipartite graphs. We determine exact values when $r=2$ and describe
Mohar, Bojan +3 more
core +4 more sources
On the Palette Index of Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2018 The palette of a vertex x of a graph G determined by a proper edge colouring φ of G is the set {φ(xy) : xy ∈ E(G)} and the diversity of φ is the number of different palettes determined by φ. The palette index of G is the minimum of diversities of φ taken
Horňák Mirko, Hudák Juraj
doaj +2 more sources
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jendrol’, Stanislav +2 more
openaire +4 more sources
Complexity of Products of Some Complete and Complete Bipartite Graphs
Journal of Applied Mathematics, 2013 The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete ...
S. N. Daoud
doaj +2 more sources