Zobrazeno 1 - 10 of 12 pro vyhledávání: '"Nian-Zu Li"'
1
Dissertation/ Thesis
The Effects of Background Lightness and Hue and Illumination period and wavelength on Presentation of Chromatophores of Atydae Shrimp (Neocaridina denticulata).
Autor: Nian-Zu Li, 李念祖
99
The marketing price of atydae shrimp(cherry shrimp, Neocaridina denticulata) is greatly influenced by its pigmentation, which is directly influenced by changes in chromatophores.In this thesis, effects of background lightness, hue, illuminati
Externí odkaz: http://ndltd.ncl.edu.tw/handle/33605770739427195371
Zobrazit plný text záznamu
2
Graphs with chromatic polynomial ∑l⩽m0lm0−l(λ)l
Autor: Nian-Zu Li, Chengfu Ye
Publikováno v: Discrete Mathematics. 259:369-381
In this paper, using the properties of chromatic polynomial and adjoint polynomial, we characterize all graphs having chromatic polynomial ∑l⩽m0lm0−l(λ)l.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39bfecf68e84bc531841c7c9206050df
https://doi.org/10.1016/s0012-365x(02)00592-7
Zobrazit plný text záznamu
3
On q-graphs
Autor: Zhi-Yi Guo, Chong-Yun Chao, Nian-Zu Li
Publikováno v: Discrete Mathematics. 172(1-3):9-16
Let q be a positive integer. A graph G is said to be a q-graph if it contains a q-tree as one of its spanning subgraphs. A connected graph is a 1-graph. (1) We prove that if G is a q-graph with |V(G)| > q, then the multiplicity of the root q of the c
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88e02966857bf62af7d5a156348ba062
Zobrazit plný text záznamu
4
Chromatic uniqueness of the complements of certain forests
Autor: Ruying Liu, Xue-Wen Bao, Nian-Zu Li
Publikováno v: Discrete Mathematics. 172(1-3):79-84
A tree is called a tree of T -shape if its degree sequence is (1,1,1,2,2, …, 2,3). In this paper, we prove that the complement of the disjoint union of any number copies of a kind of tree of T -shape is chromatically unique by studying its adjoint
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f747932ca7b0804cf3f71bad71723f93
Zobrazit plný text záznamu
6
The chromaticity of certain graphs with five triangles
Autor: Earl Glen Whitehead, Nian-Zu Li
Publikováno v: Discrete Mathematics. 122:365-372
Let W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of W(n, 6) which can be obtained from the coefficients of th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::448cca292fc601d6775107e0a4eb3209
https://doi.org/10.1016/0012-365x(93)90312-h
Zobrazit plný text záznamu
7
On graphs having σ-polynomials of the same degree
Autor: Nian-Zu Li
Publikováno v: Discrete Mathematics. 110:185-196
Frucht and Giudici classified all graphs having quadratic σ-polynomials. Dhurandhar characterized all graphs having quadratic and cubic σ-polynomials. Here, we give a necessary and sufficient condition for the graphs whose σ-polynomials are of deg
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0ffacacb327476eb15d14346045efad
https://doi.org/10.1016/0012-365x(92)90707-m
Zobrazit plný text záznamu
8
The chromatic uniqueness of W10
Autor: Nian-Zu Li, Earl Glen Whitehead
Publikováno v: Discrete Mathematics. 104:197-199
Xu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is known that the wheels on six vertices and eight vertices are not chromatically unique. Read found that the wheel on ten vertices is chromatically unique by comput
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aff9fdfcdcdad9ef6ad0de9a79e46d36
https://doi.org/10.1016/0012-365x(92)90334-c
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje