Previous Page 4

Displaying 61 – 73 of 73

Showing per page

The Wiener number of Kneser graphs

Rangaswami Balakrishnan, S. Francis Raj (2008)

Discussiones Mathematicae Graph Theory

The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance function on G. The Wiener number has important applications in chemistry. We determine the Wiener number of an important family of graphs, namely, the Kneser graphs.

The Wiener number of powers of the Mycielskian

Rangaswami Balakrishnan, S. Francis Raj (2010)

Discussiones Mathematicae Graph Theory

The Wiener number of a graph G is defined as 1 / 2 u , v V ( G ) d ( u , v ) , d the distance function on G. The Wiener number has important applications in chemistry. We determine a formula for the Wiener number of an important graph family, namely, the Mycielskians μ(G) of graphs G. Using this, we show that for k ≥ 1, W ( μ ( S k ) ) W ( μ ( T k ) ) W ( μ ( P k ) ) , where Sₙ, Tₙ and Pₙ denote a star, a general tree and a path on n vertices respectively. We also obtain Nordhaus-Gaddum type inequality for the Wiener number of μ ( G k ) .

Using DNA Self-assembly Design Strategies to Motivate Graph Theory Concepts

J. Ellis-Monaghan, G. Pangborn (2011)

Mathematical Modelling of Natural Phenomena

A number of exciting new laboratory techniques have been developed using the Watson-Crick complementarity properties of DNA strands to achieve the self-assembly of graphical complexes. For all of these methods, an essential step in building the self-assembling nanostructure is designing the component molecular building blocks. These design strategy problems fall naturally into the realm of graph theory. We describe graph theoretical formalism for various construction methods, and then suggest several...

Currently displaying 61 – 73 of 73

Previous Page 4