Seminar za kombinatornu i diskretnu matematiku

lokacija: 
Građevinski fakultet Zagreb
vrijeme: 
16.04.2026 - 15:00 - 19:00

U četvrtak 16. travnja 2026. na Građevinskom fakultetu (Kačićeva 26) u učionici 121 od 15 do 19 sati

u okviru Seminara za kombinatornu i diskretnu matematiku održat će se četiri predavanja:

 

Professor Joseph Varghese Kureethara, CHRIST University, Bangalore, Indija

 

Title: Inverse Problems in the Zagreb Indexes

 

Abstract: The Zagreb group of indices was a miraculous invention that occurred in 1972.

Given a graph, computing its Zagreb index, and given a number, identifying a

graph or a set of graphs with that number as their Zagreb index have been two

research tracks. The latter is termed an inverse problem. The first and the

second reformulated Zagreb indexes had been in the literature for some time.

 

We explore the inverse problems associated with the first and the second

reformulated Zagreb indexes. We also see recent developments in this area.

 

 

Professor Tabitha Rajashekar, CHRIST University, Bangalore, Indija

 

Title: On NCC Partitioning in Graphs: Structural Analysis

 

Abstract: A simple graph G admits neighbourhood-closed-co-neighbourhood partitioning

(NCC partitioning) if there exists a vertex a, a ∈ V (G)  such that the

subgraph induced by the set of neighbours of a is isomorphic to the subgraph

induced by the set of non-neighbours of a. In this talks, we present some

structural properties of graphs which admit NCC partitioning. We also

investigate various degree-based and distance-based parameters of such graphs.

 

 

Professor Tomislav Došlić, University of Zagreb, Zagreb, Croatia

 

Title: Topological indices and (why) do we (still) need them

 

Abstract: In this talk, we address the problem of proliferation of topological indices

and some possible remedies.

 

 

Dr. Luka Podrug, University of Zagreb, Zagreb, Croatia

 

Title: Honeycomb Strip Partition Problems and Fibonacci Numbers

 

Abstract: We consider narrow strips in a regular hexagonal lattice and study on how many ways they can be decomposed in general as well as into a specified number of connected parts. We show that the number of such decompositions is determined by the Fibonacci sequence with odd indices, thereby yielding a new combinatorial interpretation of these numbers. To establish the result, we present three different proofs, each based on a different combinatorial perspective of the underlying structure.

 

Pozivaju se članovi Seminara i svi ostali zainteresirani da prisustvuju ovim predavanjima.

 

Tajnik seminara,

Goran Igaly

Share this