A graph is called $1$-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let $G$ be a bipartite $1$-planar graph with $n$ ($nge 4$) vertices and $m$ edges. Karpov showed that $mle 3n-8$ holds for even $nge 8$ and $mle 3n-9$ ...
Design of a prediction system based on the dynamical feed-forward neural network Guo, Xiaoxiang; Han, Weimin; Ren, Jingli Sci China Inf Sci, 2023, 66(1): 112102Keywords: prediction system; phase space reconstruction; topological equivalence; dynamical feed-forward neural network; integer constrained...
For the spectral radius of an edge-most outer-planar bipartite graph G with an order n, two upper bounds are shown to be that: if n is even, then ; if n is odd, then .关键词: spectral radius edge-most outer-planar bipartite
D. V. Karpov. An upper bound on the number of edges in an almost planar bipartite graph. J. Math. Sci., 196(6):737-746, 2014.D. V. Karpov. An upper bound on the number of edges in an almost planar bipartite graph. Journal of Mathematical Sciences, 196(6):737-746, 2014....
The complete bipartite graph (2-partite graph) with part sizes m and n is denoted by Km,n. The girth of G is the length of a shortest cycle in G and is denoted by gr(G). If G has no cycles, we define the girth of G to be infinite. A graph G is said to be planar if it...
21. The exact characteristics of how both QA and QAOA will scale to large system sizes, especially on noisy hardware, is currently not fully understood22,23,24. There is evidence that QAOA may be more difficult for classical computers to simulate than quantum annealing, which could make it a...
Let q(G) denote the minimum integer t for which E ( G ) can be partitioned into t induced matchings of G . Faudree et al. conjectured that q(G)d2, if G is a bipartite graph and d is the maximum degree of G . In this note, we give an affirmative answer for d =3, the fi...
Unlike regular elastic materials, when auxetic materials are compressed, they become thinner in the direction perpendicular to the applied force. Despite their outstanding mechanical properties, a systematic design of new and controlled auxetics remains underdeveloped. Here we establish a unified framework...
【24hr】3-D object recognition using bipartite matching embedded in discrete relaxation 包量 机译 使用嵌入离散松弛的二分匹配进行3D对象识别 作者:Kim W.-Y.;Kak A.C.; 刊名:IEEE Transactions on Pattern Analysis and Machine Intelligence 1991年第3期 摘要:The authors show ...
The same task for graphs, however, is much more complex, since one cannot simply compare the sets of nodes and edges, which are generally unordered and of different sizes. In the last decades various procedures for evaluating proximity, that is similarity or dissimilarity, of graphs have been ...