Zobrazeno 1 - 10
of 283
pro vyhledávání: '"Li, Chengli"'
A local subgraph of a graph is the subgraph induced by the neighborhood of a vertex. Thus a graph of order $n$ has $n$ local subgraphs. A graph $G$ is called locally nonforesty if every local subgraph of $G$ contains a cycle. Recently, in studying fo
Externí odkaz:
http://arxiv.org/abs/2410.23702
Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. The circumference $c(G)$ and induced circumference $c'(G)$ of a graph $G$ are the length of its longest cycles and the length of its longest
Externí odkaz:
http://arxiv.org/abs/2410.19005
A $k$-cycle in a graph is a cycle of length $k.$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3\le k\le n,$ every edge of $G$ lies in a $k$-cycle. It seems difficult to determine the minimum size $f(n)$ of a simple
Externí odkaz:
http://arxiv.org/abs/2410.11183
Autor:
Li, Chengli, Liu, Feng
Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is said to be
Externí odkaz:
http://arxiv.org/abs/2406.07942
Autor:
Li, Chengli, Tang, Yurui
Recently, Ma, Qian and Shi determined the maximum size of an $n$-vertex graph with given fractional matching number $s$ and maximum degree at most $d$. Motivated by this result, we determine the maximum number of $\ell$-cliques in a graph with given
Externí odkaz:
http://arxiv.org/abs/2404.11268
Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does not discon
Externí odkaz:
http://arxiv.org/abs/2311.02571
Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. For a positive real number $t$, a non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of co
Externí odkaz:
http://arxiv.org/abs/2303.09741
Publikováno v:
In Ceramics International 1 November 2024 50(21) Part B:42593-42606
Publikováno v:
In Journal of Molecular Structure 15 February 2025 1322 Part 1
Publikováno v:
In Infrared Physics and Technology December 2024 143