Open AccessM_n – Polynomials of Some Special Graphs
Author(s) -
Raghad Mustafa,
Ahmed M. Ali,
AbdulSattar M. Khidhir
Publication year - 2021
Publication title -
iraqi journal of science
Language(s) - English
Resource type - Journals
eISSN - 2312-1637
pISSN - 0067-2904
DOI - 10.24996/ijs.2021.62.6.24
Subject(s) - combinatorics , mathematics , bipartite graph , distance , vertex (graph theory) , path graph , discrete mathematics , graph , shortest path problem , graph power , line graph
Let be a connected graph with vertices set and edges set . The ordinary distance between any two vertices of is a mapping from into a nonnegative integer number such that is the length of a shortest path. The maximum distance between two subsets and of is the maximum distance between any two vertices and such that belong to and belong to . In this paper, we take a special case of maximum distance when consists of one vertex and consists of vertices, . This distance is defined by: where is the order of a graph .
In this paper, we defined – polynomials based on the maximum distance between a vertex in and a subset that has vertices of a vertex set of and – index. Also, we find polynomials for some special graphs, such as: complete, complete bipartite, star, wheel, and fan graphs, in addition to polynomials of path, cycle, and Jahangir graphs. Then we determine the indices of these distances.