Illustrating a Graph Coloring Algorithm Based on the Principle of Inclusion and Exclusion Using GraphTea

Rostami, M. Ali; Bücker, H. Martin; Azadi, Azin

doi:10.1007/978-3-319-11200-8_54

Cited by 8 publications

(10 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For computational purposes, we use the software GraphTea (see [3]) considering various phases of testing. GraphTea is graph visualization software designed specifically to visualize and explore graph algorithms and the topological indices interactively.…”

Section: Computational Resultsmentioning

confidence: 99%

On the bounds of the forgotten topological index

Elumalai¹,

Mansour²,

Rostami³

2017

Turk J Math

View full text Add to dashboard Cite

The forgotten topological index is defined as the sum of cubes of the degrees of the vertices of the molecular graph G. In this paper, we obtain, analyze, and compare various lower bounds for the forgotten topological index involving the number of vertices, edges, and maximum and minimum vertex degree. Then we give Nordhaus-Gaddumtype inequalities for the forgotten topological index and coindex. Finally, we correct the number of extremal chemical trees on 15 vertices.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

On the bounds of the forgotten topological index

Elumalai¹,

Mansour²,

Rostami³

2017

Turk J Math

View full text Add to dashboard Cite

show abstract

“…For computational purpose, we used GraphTea [1], a software tool focusing on extracting information and visualization on graphical problems. It offers powerful ways to query or directly interact with properties of a particular instance of a graphical problem.…”

Section: Computational Resultsmentioning

confidence: 99%

New Sharp lower bounds for the first Zagreb index

Mansour¹,

Rostami²,

Suresh³

et al. 2016

Sci Publ State Univ Novi Pazar Ser A

View full text Add to dashboard Cite

“…In order to study and investigate the graph-theoretical properties of these topological indices, we use the software GraphTea [1]. GraphTea is an interactive graph-editing framework to extract information from graphs.…”

Section: −1mentioning

confidence: 99%

Correcting a paper on the Randi{\'c} and geometric--arithmetic indices

Mansour¹,

Rostami²,

Elumalai³

et al. 2017

Turk J Math

View full text Add to dashboard Cite

The Randić index (R) and the geometric-arithmetic index (GA) are found to be useful tools in QSPR and QSAR studies. In the Journal of Inequalities and Applications 180, 1-7, Lokesha, Shwetha Shetty, Ranjini, Cangul, and Cevik gave "New bounds for Randić and GA indices." In the paper, we first point out that Theorems 1, 2, and 4 are incorrect and in this short note we present the correct inequalities for Randić and GA indices. In the same paper, we provide the equality cases for Theorems 3, 5, and 6.

show abstract

Illustrating a Graph Coloring Algorithm Based on the Principle of Inclusion and Exclusion Using GraphTea

Cited by 8 publications

References 3 publications

On the bounds of the forgotten topological index

On the bounds of the forgotten topological index

New Sharp lower bounds for the first Zagreb index

Correcting a paper on the Randi{\'c} and geometric--arithmetic indices

Contact Info

Product

Resources

About