Zobrazeno 1 - 10
of 235
pro vyhledávání: '"Tu, Jianhua"'
Let $G$ be a simple graph. A dissociation set of $G$ is defined as a set of vertices that induces a subgraph in which every vertex has a degree of at most 1. A dissociation set is maximal if it is not contained as a proper subset in any other dissoci
Externí odkaz:
http://arxiv.org/abs/2410.20462
Autor:
Tian, Yuting, Tu, Jianhua
Let $MIS(G)$ be the set of all maximal independent sets in a graph $G$, and let $mis(G)=|MIS(G)|$. In this paper, we show that for any tree $T$ with $n$ vertices and independence number $\alpha$, \[mis(T)\geq f(n-\alpha),\] and for any unicyclic grap
Externí odkaz:
http://arxiv.org/abs/2410.17717
Publikováno v:
In Journal of the Energy Institute October 2024 116
Autor:
Tu, Jianhua
Given a graph $G=(V,E)$ and a positive integer $k\ge2$, a $k$-path vertex cover is a subset of vertices $F$ such that every path on $k$ vertices in $G$ contains at least one vertex from $F$. A minimum $k$-path vertex cover in $G$ is a $k$-path vertex
Externí odkaz:
http://arxiv.org/abs/2201.03397
Autor:
Tian, Yuting, Tu, Jianhua
Publikováno v:
In Applied Mathematics and Computation 1 August 2024 474
Publikováno v:
In Discrete Mathematics May 2024 347(5)
In a graph $G$, a subset of vertices is a dissociation set if it induces a subgraph with vertex degree at most 1. A maximum dissociation set is a dissociation set of maximum cardinality. The dissociation number of $G$, denoted by $\psi(G)$, is the ca
Externí odkaz:
http://arxiv.org/abs/2103.01407
A subset of vertices $F$ in a graph $G$ is called a \emph{dissociation set} if the induced subgraph $G[F]$ of $G$ has maximum degree at most 1. A \emph{maximal dissociation set} of $G$ is a dissociation set which is not a proper subset of any other d
Externí odkaz:
http://arxiv.org/abs/2103.01402
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-hard even for bipartite graphs and is called the maximum dissociation s
Externí odkaz:
http://arxiv.org/abs/2102.12053
Autor:
Mo, Ziming, He, Yao, Liu, Jingyong, Tu, Jianhua, Li, Detao, Hu, Changsong, Zhang, Qian, Wang, Kaige, Wang, Tiejun
Publikováno v:
In International Journal of Hydrogen Energy 2 January 2024 49 Part A:164-176