𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the null-spaces of acyclic and unicyclic singular graphs

✍ Scribed by Milan Nath; Bhaba Kumar Sarma

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
228 KB
Volume
427
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the acyclic choosability of graphs
On the acyclic choosability of graphs
✍ MickaΓ«l Montassier; Pascal Ochem; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 348 KB

## Abstract A proper vertex coloring of a graph __G__ =  (__V,E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is __L__‐list colorable if for a given list assignment __L__ = {L(__v__): __v__β€‰βˆˆ __V__}, there exists a proper coloring __c__ of __G__ such that __c__ (__v__)β€‰βˆˆβ€‰__L__(_

An edge grafting theorem on the energy o
An edge grafting theorem on the energy of unicyclic and bipartite graphs
✍ Hai-Ying Shan; Jia-Yu Shao; Fei Gong; Yue Liu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 159 KB

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The edge grafting operation on a graph is certain kind of edge moving between two pendant paths starting from the same vertex. In this paper we show how the graph energy changes under the edge graftin

On the chromatic spectrum of acyclic dec
On the chromatic spectrum of acyclic decompositions of graphs
✍ Robert E. Jamison; Eric Mendelsohn πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

## Abstract If __G__ is any graph, a __G‐decomposition__ of a __host__ graph __H__ = (__V__, __E__) is a partition of the edge set of __H__ into subgraphs of __H__ which are isomorphic to __G__. The __chromatic index__ of a __G__‐decomposition is the minimum number of colors required to color the p