Results 1 to 10 of about 4,095 (160)
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 +3 more sources
Topological drawings of complete bipartite graphs [PDF]
Journal of Computational Geometry, 2018 Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points.
Jean Cardinal, Stefan Felsner
doaj +6 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
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2020 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. Then we apply the effective resistance (i.e., resistance distance in graphs) to find a formula for the number of spanning trees in the nearly complete bipartite graph $G(
Jun Ge, Fengming Dong
exaly +5 more sources
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +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
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics, 2018 8 pages, several typos ...
Ervin Győri +2 more
exaly +5 more sources
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, Yoshio Sano, Boram Park
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 +2 more sources
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
openaire +5 more sources