Autor: Mao, Yaping - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: The Vertex-Rainbow Index of A Graph
Autorzy:: Mao, Yaping
Tematy:: vertex-coloring
connectivity
vertex-rainbow S-tree
vertex- rainbow index
Nordhaus-Gaddum type; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31340818.pdf Link otwiera się w nowym oknie
Opis:: The k-rainbow index rx_k(G) of a connected graph G was introduced by Chartrand, Okamoto and Zhang in 2010. As a natural counterpart of the k-rainbow index, we introduce the concept of k-vertex-rainbow index rvx_k(G) in this paper. In this paper, sharp upper and lower bounds of rvx_k(G) are given for a connected graph G of order n, that is, 0 ≤ rvx_k(G) ≤ n − 2. We obtain Nordhaus-Gaddum results for 3-vertex-rainbow index of a graph G of order n, and show that rvx₃(G) + rvx₃(Ḡ) = 4 for n = 4 and 2 ≤ rvx₃(G) + rvx₃(Ḡ) ≤ n − 1 for n ≥ 5. Let t(n, k, ℓ) denote the minimal size of a connected graph G of order n with rvx_k(G) ≤ ℓ, where 2 ≤ ℓ ≤ n − 2 and 2 ≤ k ≤ n. Upper and lower bounds on t(n, k, ℓ) are also obtained.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Graphs with Large Generalized (Edge-)Connectivity
Autorzy:: Li, Xueliang
Mao, Yaping
Tematy:: (edge-)connectivity
Steiner tree
internally disjoint trees
edge-disjoint trees
packing
generalized (edge-)connectivity; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31340594.pdf Link otwiera się w nowym oknie
Opis:: The generalized $k$-connectivity $ \kappa_k (G) $ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized $k$-edge-connectivity $ \lambda_k (G)$. In this paper, graphs of order $n$ such that $ \kappa_k (G) = n - k/2 - 1 $ and $ \lambda_k (G) = n - k/2 - 1 $ for even $k$ are characterized.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: The Steiner Wiener Index of A Graph
Autorzy:: Li, Xueliang
Mao, Yaping
Gutman, Ivan
Tematy:: distance
Steiner distance
Wiener index
Steiner Wiener k- index; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31340916.pdf Link otwiera się w nowym oknie
Opis:: The Wiener index $ W(G) $ of a connected graph $G$, introduced by Wiener in 1947, is defined as $ W(G) = \Sigma_{ u,v \in V(G) } d(u, v) $ where $ d_G(u, v) $ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least 2 and $ S \subseteq V (G) $, the Steiner distance $d(S)$ of the vertices of $S$ is the minimum size of a connected subgraph whose vertex set is $S$. We now introduce the concept of the Steiner Wiener index of a graph. The Steiner k-Wiener index $ SW_k(G) $ of $ G $ is defined by $ \Sigma_{ S \subseteq V(G) \ |S| = k } \ d(S) $. Expressions for $ SW_k $ for some special graphs are obtained. We also give sharp upper and lower bounds of $ SW_k $ of a connected graph, and establish some of its properties in the case of trees. An application in chemistry of the Steiner Wiener index is reported in our another paper.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Inverse Problem on the Steiner Wiener Index
Autorzy:: Li, Xueliang
Mao, Yaping
Gutman, Ivan
Tematy:: distance
Steiner distance
Wiener index
Steiner Wiener index; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31342440.pdf Link otwiera się w nowym oknie
Opis:: The Wiener index $ W(G) $ of a connected graph $G$, introduced by Wiener in 1947, is defined as $ W(G) = \Sigma_{ u,v \in V (G) } \ d_G(u, v) $, where $ d_G(u, v) $ is the distance (the length a shortest path) between the vertices $u$ and $v$ in $G$. For $ S \subseteq V (G) $, the Steiner distance $d(S)$ of the vertices of $S$, introduced by Chartrand et al. in 1989, is the minimum size of a connected subgraph of $G$ whose vertex set contains $S$. The $k$-th Steiner Wiener index $ SW_k(G) $ of $G$ is defined as $ SW_k(G)= \Sigma_{ S \subseteq V(G) \ |S|=k } \ d(S) $. We investigate the following problem: Fixed a positive integer $k$, for what kind of positive integer w does there exist a connected graph $G$ (or a tree $T$) of order $ n \ge k$ such that $ SW_k(G) = w$ (or $ SW_k(T) = w$)? In this paper, we give some solutions to this problem.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Ramsey and Gallai-Ramsey numbers for forests
Autorzy:: Gao, Yujia
Ji, Meng
Mao, Yaping
Wei, Meiqin
Tematy:: Ramsey number
Gallai-Ramsey number
edge-coloring; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/63481990.pdf Link otwiera się w nowym oknie
Opis:: Given two non-empty graphs $G,H$ and a positive integer $k$, the Gallai-Ramsey number $gr_k(G:H)$ is defined as the minimum integer $N$ such that for all $n\geq N$, every $k$-edge-coloring of $K_n$ contains either a rainbow copy of $G$ or a monochromatic copy of $H$. Given a graph $H$, the $k$-color Ramsey number $\text{R}_{k}(H)$ is the minimum number $n$ such that every $k$-edge-coloring of $K_{n}$ contains a monochromatic $H$. In this paper, we determine several exact values and bounds for Gallai-Ramsey numbers $gr_k(G:H)$ and Ramsey numbers $\text{R}_3(H)$, where $G$ is a special tree and $H$ is a union of stars.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
Autorzy:: Li, Luyi
Li, Xueliang
Mao, Yaping
Si, Yuan
Tematy:: Ramsey theory
Gallai-Ramsey number
complete bipartite graph; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/63381384.pdf Link otwiera się w nowym oknie
Opis:: Given two non-empty graphs $G,H$ and a positive integer $k$, the Gallai-Ramsey number $\text{gr}_k(G:H)$ is defined as the minimum positive integer $N$ such that for all $n\geq N$, every $k$-edge-colored $K_n$ contains either a rainbow subgraph $G$ or a monochromatic subgraph $H$. In this paper, we get some exact values or bounds of $\text{gr}_k(K_{1,3}:H)$, $\text{gr}_k(P_5:H)$, and $\text{gr}_k(P_4^{+}:H)$ for $k\geq 3$, where $H$ is a complete bipartite graph.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
Autorzy:: Wu, Jichang
Broersma, Hajo
Mao, Yaping
Ma, Qin
Tematy:: 4-connected graph
removable edge
fragment
atom; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/32083895.pdf Link otwiera się w nowym oknie
Opis:: Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G; if there are vertices with degree 3 in G−e, then for each (of the at most two) such vertex x, delete x from G − e and turn the three neighbors of x into a clique by adding any missing edges (avoiding multiple edges). In this paper, we continue the study on the distribution of removable edges in a 4-connected graph G, in particular outside a cycle of G or in a spanning tree or on a Hamilton cycle of G. We give examples to show that our results are in some sense best possible.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: Conflict-Free Vertex-Connections of Graphs
Autorzy:: Li, Xueliang
Zhang, Yingying
Zhu, Xiaoyu
Mao, Yaping
Zhao, Haixing
Jendrol’, Stanislav
Tematy:: vertex-coloring
conflict-free vertex-connection
2-connected graph
tree; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31868621.pdf Link otwiera się w nowym oknie
Opis:: A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path. This paper investigates the question: for a connected graph G, what is the smallest number of colors needed in a vertex-coloring of G in order to make G conflict-free vertex-connected. As a result, we get that the answer is easy for 2-connected graphs, and very difficult for connected graphs with more cut-vertices, including trees.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: Probiotics, prebiotics, lactoferrin, and combination products for prevention of mortality and morbidity in preterm infants : a systematic review and network meta-analysis
Autorzy:: Zeraatkar, Dena
Foroutan, Farid
Crandon, Holly N.
Mao, Randi Q.
Sherman, Philip M.
Offringa, Martin
Florez, Ivan D.
Shahid, Shaneela
Wang, Xiaoqin
El Gouhary, Enas
Sadeghirad, Behnam
Guyatt, Gordon H.
Morgan, Rebecca L.
Tao, Brendan
Beyene, Joseph
Bała, Małgorzata
Chang, Yaping
Wang, Yuting
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Informacja

Wyszukujesz frazę "Mao, Yaping" wg kryterium: Autor