2008/28/3

On locating and differentiating-total domination in trees

On critical and cocritical radius edge-invariant graphs

On distinguishing and distinguishing chromatic numbers of hypercubes

Product rosy labeling of graphs

On long cycles through four prescribed vertices of a polyhedral graph

The bondage number of graphs: good and bad vertices

Embedding complete ternary trees into hypercubes

The signed matchings in graphs

Order unicyclic graphs according to spectral radius of unoriented laplacian matrix

On the tree graph of a connected graph

The sizes of components in random circle graphs

Independent cycles and paths in bipartite balanced graphs

Path and cycle factors of cubic bipartite graphs

A result related to the largest eigenvalue of a tree

Triangle-free planar graphs with minimum degree 3 have radius at least 3