<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In this paper we introduce the walk polynomial to find the number of walks of different lengths in a simple connected graph. We also give the walk polynomial of the bipartite, star, wheel, and gear graphs in closed forms.</p></abstract>

In this paper we introduce the walk polynomial to find the number of walks of different lengths in a simple connected graph. We also give the walk polynomial of the bipartite, star, wheel, and gear graphs in closed forms.

WALK POLYNOMIAL: A New Graph Invariant

The University of Lahore Pakpattan Campus

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"WALK POLYNOMIAL: A New Graph Invariant"}

In this paper we introduce the walk polynomial to find the number of walks of different lengths in a simple connected graph. We also give the walk polynomial...

WALK POLYNOMIAL: A New Graph Invariant

Publicado en línea: 01 jul 2018

Páginas: 321 - 330

Recibido: 07 abr 2018

Aceptado: 01 jul 2018

DOI: https://doi.org/10.21042/AMNS.2018.1.00025

Palabras clave
Walk, Walk polynomial, Adjacency matrix, Bipartite graph, Gear graph

© 2018 Abdul Rauf Nizami et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

WALK POLYNOMIAL: A New Graph Invariant

Publicado en línea: 01 jul 2018

Páginas: 321 - 330

Recibido: 07 abr 2018

Aceptado: 01 jul 2018

DOI: https://doi.org/10.21042/AMNS.2018.1.00025

Palabras claveWalk, Walk polynomial, Adjacency matrix, Bipartite graph, Gear graph

© 2018 Abdul Rauf Nizami et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Palabras clave
Walk, Walk polynomial, Adjacency matrix, Bipartite graph, Gear graph