Results 1 to 10 of about 96,090 (258)
The competition graphs of oriented complete bipartite graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suh-Ryung Kim +2 more
exaly +3 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 +3 more sources
Generalized Turán Problems for Complete Bipartite Graphs
Graphs and Combinatorics, 2022 For graphs H, F and integer n, the generalized Turán number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.
Daniel Gerbner +2 more
exaly +2 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
Higher matching complexes of complete graphs and complete bipartite graphs [PDF]
Discrete Mathematics, 2020 For $r\geq 1$, the $r$-matching complex of a graph $G$, denoted $M_r(G)$, is a simplicial complex whose faces are the subsets $H \subseteq E(G)$ of the edge set of $G$ such that the degree of any vertex in the induced subgraph $G[H]$ is at most $r$.
Anurag Singh
semanticscholar +4 more sources
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2019 Using the theory of electrical network, we first obtain a simple formula for the number of spanning trees of a complete bipartite graph containing a certain matching or a certain tree.
Jun Ge, F. Dong
semanticscholar +5 more sources
Packing Trees in Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2022 An embedding of a graph H in a graph G is an injection (i.e., a one-to-one function) σ from the vertices of H to the vertices of G such that σ(x)σ(y) is an edge of G for all edges xy of H. The image of H in G under σ is denoted by σ(H).
Wang Jieyan
doaj +2 more sources
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +4 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 +5 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