Zobrazeno 1 - 10
of 535
pro vyhledávání: '"Zhang Shenggui"'
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for
Externí odkaz:
http://arxiv.org/abs/2409.13491
Publikováno v:
Jixie qiangdu, Vol 42, Pp 246-250 (2020)
The methods of consistency evaluation are introduced for the finite element simulation and test of the aircraft structure. First,the strain interpolation method is studied based on the element shape functions,and the transformation method is given fo
Externí odkaz:
https://doaj.org/article/2bd4cd47256e400a94c63cfed8684de3
An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges having the same color. Given a tree $T_0$, let $\mathcal{T}(n,T_0)$ be
Externí odkaz:
http://arxiv.org/abs/2403.09082
Publikováno v:
E3S Web of Conferences, Vol 233, p 04035 (2021)
In this paper, combined with the actual engineering, a modular transportation status monitoring system is designed, which can be used to measure environmental conditions such as vibration, inclination, temperature and humidity during the process of t
Externí odkaz:
https://doaj.org/article/32cae20e810341928ef5b0a7a081afac
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 915-929 (2016)
A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general. We study the
Externí odkaz:
https://doaj.org/article/d0375a48f0474f1fb97fb44a55e46d6d
Autor:
Lia Binlong, Zhang Shenggui
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 383-392 (2016)
Let G be a graph on n vertices. A vertex of G with degree at least n/2 is called a heavy vertex, and a cycle of G which contains all the heavy vertices of G is called a heavy cycle. In this note, we characterize graphs which contain no heavy cycles.
Externí odkaz:
https://doaj.org/article/2c00d234d7704d0baa12449c43f86f2d
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-typ
Externí odkaz:
https://doaj.org/article/8a2b714b768147569667b7e7e4c1a5b1
This paper presents the following research findings on Boolean networks (BNs) and their dual subspaces.First, we establish a bijection between the dual subspaces of a BN and the partitions of its state set. Furthermore, we demonstrate that a dual sub
Externí odkaz:
http://arxiv.org/abs/2301.10961
Publikováno v:
In Linear Algebra and Its Applications 15 December 2024 703:289-301
Publikováno v:
In LWT 1 December 2024 213