Zobrazeno 1 - 10
of 981
pro vyhledávání: '"Gu Xiaofeng"'
Publikováno v:
E3S Web of Conferences, Vol 512, p 04012 (2024)
This paper studies the visual quality evaluation method along the tourist highway from the driver’s first perspective, selects five evaluation indexes from the aspects of driver’s driving reaction and physiological reaction, and establishes a “
Externí odkaz:
https://doaj.org/article/79041e35138f471ba2472bd222ccb2d7
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning subgraph in a gi
Externí odkaz:
http://arxiv.org/abs/2410.21116
An $(a,b)$-biregular bipartite graph is a bipartite graph with bipartition $(X, Y)$ such that each vertex in $X$ has degree $a$ and each vertex in $Y$ has degree $b$. By the bipartite expander mixing lemma, biregular bipartite graphs have nice pseudo
Externí odkaz:
http://arxiv.org/abs/2404.06685
Publikováno v:
Dianzi Jishu Yingyong, Vol 44, Iss 3, Pp 15-18 (2018)
To meet the flexible configuration requirements of serial peripheral interface(SPI) in the System-on-a-Chip(SoC), the SPI IP core which can be configured as a master or slave with four date transfer modes and seven clock transmission rates is designe
Externí odkaz:
https://doaj.org/article/984cc7b17a074816b9d74684d287a154
Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq 2 where c(G-S) denotes the number of components of G-S. Confirming a c
Externí odkaz:
http://arxiv.org/abs/2309.05247
Autor:
WU Jun1, GU Xiaofeng1
Publikováno v:
Journal of Practical Medicine / Shiyong Yixue Zazhi. 11/10/2024, Vol. 40 Issue 21, p3090-3094. 5p.
Publikováno v:
Discrete Mathematics,2023
An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-connected) if it has no $r$-essential edge (resp. vertex) cuts of size les
Externí odkaz:
http://arxiv.org/abs/2208.12922
The spanning tree packing number of a graph $G$, denoted by $\tau(G)$, is the maximum number of edge-disjoint spanning trees contained in $G$. The study of $\tau(G)$ is one of the classic problems in graph theory. Cioab\u{a} and Wong initiated to inv
Externí odkaz:
http://arxiv.org/abs/2207.04701
Publikováno v:
The Electronic Journal of Combinatorics (2023)
A recent result of Cioab\u{a}, Dewar and Gu implies that any $k$-regular Ramanujan graph with $k\geq 8$ is globally rigid in $\mathbb{R}^2$. In this paper, we extend these results and prove that any $k$-regular Ramanujan graph of sufficiently large o
Externí odkaz:
http://arxiv.org/abs/2206.03983
Autor:
Gu, Xiaofeng, Liu, Muhuo
Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X| |Y|}{(n-|X|)(n-|
Externí odkaz:
http://arxiv.org/abs/2205.15228