Results 31 to 40 of about 2,876,957 (249)
On bipartite powers of bigraphs [PDF]
, 2012 The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper、 we investigate abipartite analogue of graph powers、 which we call bipartite powers of bigraphs.
Yota Otachi +5 more
core +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
Degree-constrained edge partitioning in graphs arising from discrete tomography
Journal of Graph Algorithms and Applications, 2009 Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k=3 colors is open.
Cedric Bentz +4 more
doaj +1 more source
Edge condition for hamiltonicity in balanced tripartite graphs [PDF]
Opuscula Mathematica, 2009 A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order \(2n\) obtained from the complete balanced bipartite \(K_{n,n}\) by removing at most \(n-2\) edges, is bipancyclic.
Janusz Adamus
doaj +1 more source
Topological Drawings of Complete Bipartite Graphs [PDF]
, 2016 Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been studied extensively in the context of crossing number problems. We consider a natural class of simple topological
Cardinal, Jean, Felsner, Stefan
openaire +5 more sources
Graceful labeling of triangular extension of complete bipartite graph [PDF]
, 2019 For positive integers m, n, K m,n represents the complete bipartite graph. We name the graph G = K m,n ⊙ K2 as triangular extension of complete bipartite graph K m,n , since there is a triangle hanging from every vertex of K m,n .
Bhoumik, Soumya +3 more
core +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Matching graphs of Hypercubes and Complete Bipartite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
The IC-Indices of Complete Bipartite Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G$ be a connected graph, and let $f$ be a function mapping $V(G)$ into ${\Bbb N}$. We define $f(H)=\sum_{v\in{V(H)}}f(v)$ for each subgraph $H$ of $G$. The function $f$ is called an IC-coloring of $G$ if for each integer $k$ in the set $\{1,2,\cdots,f(G)\}$ there exists an (induced) connected subgraph $H$ of $G$ such that $f(H)=k$, and the IC ...
Chin-Lin Shiue, Hung-Lin Fu
openaire +3 more sources
Engineering Ferrimagnetic Interactions in Molecular Quantum Systems
Angewandte Chemie, EarlyView.Heterospin nanographene architectures—constructed by covalently linking spin‐1/2$\nicefrac {1}{2}$ and spin‐1 triangular units via on‐surface synthesis—are characterized by bond‐resolved scanning probe microscopy. Inelastic electron tunneling spectroscopy probes exchange interactions within a Heisenberg model, revealing both compensated (S=0$S=0$) and ...
Elia Turco +8 more
wiley +2 more sources