In search of structural invariants

M Randić - Journal of mathematical chemistry, 1992 - Springer
Graph theory has been used for modeling chemical structures, that is, chemical compounds,
intermediates, changes, reactions and mechanisms. Among the most important such …

On the 2-rainbow independent domination numbers of some graphs

B Gabrovšek, A Peperko, J Žerovnik - Central European Journal of …, 2023 - Springer
By suitably adjusting the tropical algebra technique we compute the rainbow independent
domination numbers of several infinite families of graphs including Cartesian products C n …

[HTML][HTML] Topological graphs: a review of some of our achievements and perspectives in physical chemistry and homogeneous catalysis

S Bougueroua, Y Aboulfath… - Comptes …, 2024 - comptes-rendus.academie-sciences …
This paper reviews some of our developments in algorithmic graph theory, with some
applications in physical chemistry and catalysis. Two levels of granularity in the topological …

A fast numerical method for fractional partial integro-differential equations with spatial-time delays

E Aslan, ÖK Kürkçü, M Sezer - Applied Numerical Mathematics, 2021 - Elsevier
This study aims to efficiently solve the space-time fractional partial integro-differential
equations with spatial-time delays, employing a fast numerical methodology dependent …

Algebraic approach to fasciagraphs and rotagraphs

S Klavžar, J Žerovnik - Discrete Applied Mathematics, 1996 - Elsevier
An algebraic approach is proposed which can be used to solve different problems on
fasciagraphs and rotagraphs. A particular instance of this method computes the domination …

[PDF][PDF] A note on the domination number of the Cartesian products of paths and cycles

P Pavlic, J Zerovnik - Kragujevac Journal of Mathematics, 2013 - elib.mi.sanu.ac.rs
Using algebraic approach we implement a constant time algorithm for computing the
domination numbers of the Cartesian products of paths and cycles. Closed formulas are …

Computing graph polynomials on graphs of bounded clique-width

JA Makowsky, U Rotics, I Averbouch… - Graph-Theoretic Concepts …, 2006 - Springer
We discuss the complexity of computing various graph polynomials of graphs of fixed clique-
width. We show that the chromatic polynomial, the matching polynomial and the two-variable …

[HTML][HTML] Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers

S Klavžar, A Vesel - Discrete Applied Mathematics, 2003 - Elsevier
Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A
computer-based approach for searching graph invariants on rotagraphs is proposed and …

[PDF][PDF] Symmetry-moderated Wiener index

H Shabani, AR Ashrafi - MATCH Commun. Math. Comput …, 2016 - match.pmf.kg.ac.rs
The modified Wiener index is an algebraic modification of the classical Wiener index under
symmetry group. This graph invariant was presented by Graovac and Pisanski in 1991. In …

From a zoo to a zoology: Towards a general theory of graph polynomials

JA Makowsky - Theory of Computing Systems, 2008 - Springer
We outline a general theory of graph polynomials which covers all the examples we found in
the vast literature, in particular, the chromatic polynomial, various generalizations of the …