𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some results on the majorization theorem of connected graphs

✍ Scribed by Mu Huo Liu; Bo Lian Liu

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2012
Tongue
English
Weight
207 KB
Volume
28
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
✍ Laura A. Sanchis πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v β€’ V-V' there exists some uβ€’ V' for which {v,u} β€’E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

On some factor theorems of graphs
On some factor theorems of graphs
✍ Mao-cheng Cai πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 362 KB

The aim of this note is to show that some recently published results on graph factors derive fairly easily from Lovrisz' (g,f)-factor theorems.

Some results on the signless Laplacians
Some results on the signless Laplacians of graphs
✍ Jianfeng Wang; Qiongxiang Huang; Xinhui An; Francesco Belardo πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 277 KB

In this paper we give two results concerning the signless Laplacian spectra of simple graphs. Firstly, we give a combinatorial expression for the fourth coefficient of the (signless Laplacian) characteristic polynomial of a graph. Secondly, we consider limit points for the (signless Laplacian) eigen