Mn - Polynomials of some special for cog-graphs
The maximum distance between two subsets Ś and S of vertex set V(G) of a connected graph G is maximum distance between any two vertices u and v such that u belong to Ś and v belong to S. In this paper, we take special case of maximum distance when Ś consist of one vertex and S consist of (n - 1) ver...
Saved in:
Published in: | Journal of discrete mathematical sciences & cryptography Vol. ahead-of-print; no. ahead-of-print; pp. 1 - 16 |
---|---|
Main Authors: | , , |
Format: | Journal Article |
Language: | English |
Published: |
Taylor & Francis
31-03-2022
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The maximum distance between two subsets Ś and S of vertex set V(G) of a connected graph G is maximum distance between any two vertices u and v such that u belong to Ś and v belong to S. In this paper, we take special case of maximum distance when Ś consist of one vertex and S consist of (n - 1) vertices, n ≥ 3,. This distance is defined by:
Where p is the order of a graph G.
We founded M
n
- polynomials, M
n
- index, Hosoya polynomial and Wiener index for some special graphs such as: cog-complete, cog-star, cog-wheel, cog-path and cog-cycle. |
---|---|
ISSN: | 0972-0529 2169-0065 |
DOI: | 10.1080/09720529.2021.1995220 |