Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Zhongmei Qin"'
Publikováno v:
Medicinal Plant; Feb2024, Vol. 15 Issue 1, p38-40, 3p
Publikováno v:
Graphs and Combinatorics. 37:2521-2533
Let G be a graph and k an integer with $$2\le k\le n$$ . The k -tree-connectivity of G, denoted by $$\kappa _k(G)$$ , is defined as the minimum $$\kappa _G(S)$$ over all k-subsets S of vertices, where $$\kappa _G(S)$$ denotes the maximum number of in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e880dd7c3bca87216befd168dd0a900
https://doi.org/10.1007/s00373-021-02376-9
https://doi.org/10.1007/s00373-021-02376-9
Autor:
YONGXIN LAN1 lan@mail.nankai.edu.cn, ZHONGMEI QIN2 qinzhongmei90@163.com, YONGTANG SHI1 shi@nankai.edu.cn
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2019, Vol. 39 Issue 4, p805-814. 10p.
Publikováno v:
Theoretical Computer Science. 774:44-50
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph G, the proper connection number p c ( G ) of G is defined as the minimum number of colors needed to color its e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2fc5364d3be1905a92f83d6d1f82ead
https://doi.org/10.1016/j.tcs.2016.04.042
https://doi.org/10.1016/j.tcs.2016.04.042
Publikováno v:
Discrete Mathematics. 342:821-835
Given a positive integer $p$ and a graph $G$ with degree sequence $d_1,\dots,d_n$, we define $e_p(G)=\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\'an-type problem for $e_p(G)$: Given a positive integer $p$ and a graph $H$, determine the func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f646318d67b1921b36f0da1c77c64b3b
https://doi.org/10.1016/j.disc.2018.11.013
https://doi.org/10.1016/j.disc.2018.11.013
Publikováno v:
Journal of Combinatorial Optimization. 36:458-471
A tree T in an edge-colored graph is called a proper tree if no two adjacent edges of T receive the same color. Let G be a connected graph of order n and k be an integer with $$2\le k \le n$$ . For $$S\subseteq V(G)$$ and $$|S| \ge 2$$ , an S-tree is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::732f60adf3415392f56c3662fecccfe2
https://doi.org/10.1007/s10878-018-0307-5
https://doi.org/10.1007/s10878-018-0307-5
Autor:
Junxue Zhang, Zhongmei Qin
Publikováno v:
Applied Mathematics and Computation. 405:126240
Let G be an edge-colored connected graph, a path (trail, walk) of G is said to be a proper-path (trail, walk) if any two adjacent edges of it are colored distinctly. If there is a proper-path (trail, walk) between each pair of different vertices of G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3faeda7db5f754faeb4a71ce563d68f
https://doi.org/10.1016/j.amc.2021.126240
https://doi.org/10.1016/j.amc.2021.126240
Publikováno v:
Discrete Mathematics. 344:112397
An eigenvalue μ of a graph G of order n is a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector e . Characterizing graphs with s ( 2 ≤ s ≤ n ) number of main eigenvalues is a long-standing problem in algebraic and graph t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d871f01422483cb72c2287ce89d89e7
https://doi.org/10.1016/j.disc.2021.112397
https://doi.org/10.1016/j.disc.2021.112397
Publikováno v:
Discrete Mathematics. 340:2217-2222
A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same color. For a connected graph G , the proper connection number p c ( G ) of G is defined as the minimum number of colors needed to color its edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b389ad1e9e1a2717f7e6b870891e91dc
https://doi.org/10.1016/j.disc.2017.04.022
https://doi.org/10.1016/j.disc.2017.04.022
Publikováno v:
Applied Mathematics and Computation. 291:30-38
A hexagonal system is a graphical representation of a benzenoid hydrocarbon in theoretical chemistry. A hexagonal chain is a cata-condensed hexagonal system with no branchings. In this paper we consider extremal hexagonal chains with respect to the c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dc6202d10b3943ddcbc380c8465068e
https://doi.org/10.1016/j.amc.2016.06.025
https://doi.org/10.1016/j.amc.2016.06.025