Computing the Schultz polynomials and indices for ladder related graphs
Abstract Distance is an important graph invariant that has wide applications in computing science and other fields of sciences. A topological index is a genuine number connected with compound constitution indicating for relationship of compound structure with different physical properties, synthetic...
Guardado en:
| Autor principal: | |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2019
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000501081 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract Distance is an important graph invariant that has wide applications in computing science and other fields of sciences. A topological index is a genuine number connected with compound constitution indicating for relationship of compound structure with different physical properties, synthetic reactivity or natural action. The Schultz and modified Schultz polynomials and their corresponding indices are used in synthetic graph theory as in light of vertex degrees. In this paper, the Schultz and modified Schultz polynomials and their corresponding indices for Mongolian tent graph, diamond graph and double fan are determined. |
|---|