|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | L(j,k)-number of Direct Product of Path and Cycle显示文摘For positive numbers j and k, an L(j,k)-labeling f of G is an assignment of numbers to vertices of G such that |f(u)-f(v)|≥j if uv∈E(G), and |f(u)-f(v)|≥k if d(u,v)=2. Then the span of f is the difference between the maximum and the minimum numbers assigned by f. The L(j,k)-number of G, denoted by λj,k(G), is the minimum span over all L(j,k)-labelings of G. In this paper, we give some results about the L(j,k)-number of the direct product of a path and a cycle for j≤k. | Wai Chee SHIU Qiong WU | 2013 | Acta Mathematica Sinica,English Series2013，29，8： | 6 |
| 2 | Super-edge-graceful Labelings of Some Cubic Graphs显示文摘The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However,few examples except trees are known.In this paper,we exhibit two classes of infinitely manycubic graphs which are super-edge-graceful.A conjecture is proposed. | Wai Chee SHIU | 2006 | Acta Mathematica Sinica,English Series2006，22，6： | 5 |
| 3 | On the adjacent vertex-distinguishing acyclic edge coloring of some graphs显示文摘A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v,where uv ∈ E(G).The adjacent vertex distinguishing acyclic edge chromatic number of G,denoted by χAa(G),is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G.If a graph G has an adjacent vertex distinguishing acyclic edge coloring,then G is called adjacent vertex distinguishing acyclic.In this paper,we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures. | SHIU Wai Chee CHAN Wai Hong ZHANG Zhong-fu BIAN Liang | 2011 | Applied Mathematics(A Journal of Chinese Universities)2011，26，4： | 3 |
| 4 | Graphs Whose Critical Groups Have Larger Rank显示文摘图 G 的批评的组 C (G) 是跨越图的树的数字的精炼并且仔细与拉普拉斯算符矩阵被连接。让 r (G) 是发电机的最小的数字(即,等级) 组 C,(G) 和(G) 是 G 的独立周期的数字。在这份报纸,某禁止的导致的 subgraphs 为 r (G)= n 被给 3 并且有 r (G)=(G)= n 的所有图 3 被描绘。 | Yao Ping HOU Wai Chee SHIU Wai Hong CHAN | 2011 | Acta Mathematica Sinica,English Series2011，27，9： | 3 |
| 5 | Full Friendly Index Sets of Cartesian Products of Two Cycles显示文摘让 G =(V, E ) 是一张连接的简单的图。标记的 f:V 鈫 ?? 2 导致把 f 标记的一个边 * :E 鈫 ?? 2 由 f 定义 *(xy ) 为每 xy 鈭 ? E 的 = f (x)+ f (y) 。为 i 鈭 ?? 2,让的蠀 f (i)=| f ? 1 (i)|并且 e f (i)=| f *? 1 (i)| 。标记的 f 被叫友好如果 | 蠀 f (1 ) 吗?蠀 f (0 )|鈮 ? 1。为图 G 的友好标记 f,我们由 i f (G)= e f (1 ) 在 f 下面定义 G 的友好索引吗?ef(0) 。集合 { i f (G)|f 是 G 的一个友好标记 } 被称为 G 的完整的友好索引集合,由 FFI (G) 表示了。在这份报纸,我们将决定二个周期的每个笛卡儿的产品的完整的友好索引集合。标记的关键词顶点 - 友好标记 - 友好索引集合 - 二周期先生(2000 ) 题目分类 05C78 的笛卡儿的产品 - FRG/07-08/II-55 香港支持的 05C25 | Wai chee SHIU | 2010 | Acta Mathematica Sinica,English Series2010，26，7： | 2 |
| 6 | Some results on the Laplacian eigenvalues of unicyclic graphs显示文摘 | Jianxi Li Wai Chee Shiu Wai Hong Chan | 2008 | Linear Algebra and Its Applications2008，，8： | 1 |
| 7 | The exponential Diophantine equation AX2 + BY2 = Akz and its applications 显示文摘 | CAO Zhen-fu Chuan I Chu and Wai Chee Shiu | 2008 | Taiwanese Jour- nal of Mathematics2008，12，5： | 1 |
| 8 | On the vertex-arboricity of planar graphs without 7-cycles 显示文摘 | HUANG Danjun SHIU Wai Chee WANG Weifan | 2012 | Discrete Mathematics2012，312，： | 1 |
| 9 | On the Laplacian Estrada Index of a Graph显示文摘 | Li Jianxi Wai Chee Shiu Chang An | 2009 | Appl Anal Discrete Math2009，，3： | 1 |
| 10 | On the laplacian es- trada index of a graph 显示文摘 | Li Jianxi Wai Chee Shiu Chang An | 2009 | Appl Anal Diacrete Math2009，，3： | 1 |
| 11 | The Smallest Values of Algebraic Connectivity for Trees显示文摘The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ■n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ■n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al. [The ordering of trees and connected graphs by algebraic connectivity. Linear Algebra Appl., 428, 1421-1438 (2008)]. | Jian Xi LI Ji Ming GUO Wai Chee SHIU | 2012 | Acta Mathematica Sinica,English Series2012，28，10： | 1 |
| 12 | The Laplacian spectral radius of some graphs显示文摘 | Jianxi Li Wai Chee Shiu Wai Hong Chan | 2009 | Linear Algebra and Its Applications2009，，1： | 1 |
| 13 | The algebraic connectivity of lollipop graphs显示文摘 | Ji-Ming Guo Wai Chee Shiu Jianxi Li | 2011 | Linear Algebra and its Applications2011，434，： | 1 |
| 14 | The 3-choosability of plane graphs of girth 4显示文摘 | Peter C B Lam Shiu Wai Chee Song Zengmin | 2005 | Discrete Mathematics2005，294，： | 1 |
| 15 | A Relationship between the Walks and the Semi-Edge Walks of Graphs显示文摘We establish a relation between the number of semi-edge walks of a connected graph and the number of walks of two auxiliary graphs. In addition, this relation gives upper bounds on the signless Laplacian spectral radius of connected graphs and planar graphs. | Peng HUANG Wai Chee SHIU Pak Kiu SUN | 2017 | Journal of Mathematical Research with Applications2017，37，5： | 0 |
| 16 | k-Factors in Regular Graphs显示文摘在 1972 的 Plesnik 证明了那一(m −
1 ) 边甚至顺序的连接的 m 常规的图有 1 因素包含任何给定的边并且有另一 1 因素排除任何给定的 m −
1 个边。桤木等。在 1999 看了那 G 是否是一常规(2n + 1 )-edge-connected 由两部组成的图,然后, G 有 1 因素包含任何给定的边并且排除任何尺寸 n 匹配给。在这篇论文,我们获得与边连接有关的一些足够的条件让一张 n 常规的图有 k 因素包含一套边并且(或) 排除一套边,在此 1 ≤
k ≤
n/2。特别地,我们概括 Plesnik 刘等获得的结果和结果。在 1998,并且改进 Katerini 获得的结果 1993。而且,我们证明在这篇论文的结果是可能的最好。 | Wai Chee SHIU Gui Zhen LIU | 2008 | Acta Mathematica Sinica,English Series2008，24，7： | 0 |
| 17 | Distance signless Laplacian spectrum of a graph显示文摘Let G be a simple connected graph with n vertices.The transmission Tv of a vertex v is defined to be the sum of the distances from v to all other vertices in G,that is,T_(v)=Σ_(u)∈Vd_(uv),where duv denotes the distance between u and v.Let T_(1),…,T_(n)be the transmission sequence of G.Let D=(dij)_(n×n)be the distance matrix of G,and T be the transmission diagonal matrix diag(T_(1),…,T_(n)).The matrix Q(G)=T+D is called the distance signless Laplacian of G.In this paper,we provide the distance signless Laplacian spectrum of complete k-partite graph,and give some sharp lower and upper bounds on the distance signless Laplacian spectral radius q(G). | Huicai JIA Wai Chee SHIU | 2022 | Frontiers of Mathematics in China2022，17，4： | 0 |
| 18 | Unicyclic Graphs with a Perfect Matching Having Signless Laplacian Eigenvalue Two显示文摘In this paper, a necessary and sufficient condition for a unicyclic graph with a perfect matching having signless Laplacian eigenvalue 2 is deduced. | Jianxi LI Wai Chee SHIU | 2017 | Journal of Mathematical Research with Applications2017，37，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员