### Abstract

Topological indices (TIs) play an important role in studying properties of molecules. A main problem in mathematical chemistry is finding extreme graphs with respect to a given TI. In this paper extremal graphs with respect to the modified first Zagreb connection index for trees in general and for trees with given number of pendants, for unicyclic graphs with or without a fixed girth and connected graphs are determined, using methods with higher degree of generality with respect to the transformation techniques usually used in such context. These graphs are relevant for chemical studies.

Original language | English |
---|---|

Title of host publication | Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 141-148 |

Number of pages | 8 |

ISBN (Electronic) | 9781728106250 |

DOIs | |

Publication status | Published - Sep 1 2018 |

Event | 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018 - Timisoara, Romania Duration: Sep 20 2018 → Sep 23 2018 |

### Publication series

Name | Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018 |
---|

### Conference

Conference | 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018 |
---|---|

Country | Romania |

City | Timisoara |

Period | 9/20/18 → 9/23/18 |

### Fingerprint

### Keywords

- Pendants
- Topological index
- Trees
- Unicyclic graphs
- Zagreb index

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Software
- Computational Mathematics
- Modelling and Simulation
- Numerical Analysis

### Cite this

*Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018*(pp. 141-148). [8750751] (Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SYNASC.2018.00033

**Extremal graphs with respect to the modified first zagreb connection index.** / Ducoffe, Guillaume; Marinescu-Ghemeci, Ruxandra; Obreja, Camelia; Popa, Alexandru; Tache, Rozica Maria.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018.*, 8750751, Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018, Institute of Electrical and Electronics Engineers Inc., pp. 141-148, 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018, Timisoara, Romania, 9/20/18. https://doi.org/10.1109/SYNASC.2018.00033

}

TY - GEN

T1 - Extremal graphs with respect to the modified first zagreb connection index

AU - Ducoffe, Guillaume

AU - Marinescu-Ghemeci, Ruxandra

AU - Obreja, Camelia

AU - Popa, Alexandru

AU - Tache, Rozica Maria

PY - 2018/9/1

Y1 - 2018/9/1

N2 - Topological indices (TIs) play an important role in studying properties of molecules. A main problem in mathematical chemistry is finding extreme graphs with respect to a given TI. In this paper extremal graphs with respect to the modified first Zagreb connection index for trees in general and for trees with given number of pendants, for unicyclic graphs with or without a fixed girth and connected graphs are determined, using methods with higher degree of generality with respect to the transformation techniques usually used in such context. These graphs are relevant for chemical studies.

AB - Topological indices (TIs) play an important role in studying properties of molecules. A main problem in mathematical chemistry is finding extreme graphs with respect to a given TI. In this paper extremal graphs with respect to the modified first Zagreb connection index for trees in general and for trees with given number of pendants, for unicyclic graphs with or without a fixed girth and connected graphs are determined, using methods with higher degree of generality with respect to the transformation techniques usually used in such context. These graphs are relevant for chemical studies.

KW - Pendants

KW - Topological index

KW - Trees

KW - Unicyclic graphs

KW - Zagreb index

UR - http://www.scopus.com/inward/record.url?scp=85069456529&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069456529&partnerID=8YFLogxK

U2 - 10.1109/SYNASC.2018.00033

DO - 10.1109/SYNASC.2018.00033

M3 - Conference contribution

AN - SCOPUS:85069456529

T3 - Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018

SP - 141

EP - 148

BT - Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -