Filters
cris logo
-
New search Filters
Select from list
Displayed from Show more
You have reached the maximum number of displayed search results.
All results displayed
No results are available for the search performed
Displayed from
You have reached the maximum number of displayed search results.
All results displayed
Loading results
Obtaining statistical data

Projects / Programmes source: ARIS

Grafovski produkti in metrična teorija grafov (Slovene)

Edit
Research activity

Code Science Field Subfield
1.01.05  Natural sciences and mathematics  Mathematics  Graph theory 

Code Science Field
P110  Natural sciences and mathematics  Mathematical logic, set theory, combinatories 
P410  Natural sciences and mathematics  Theoretical chemistry, quantum chemistry 
Keywords
graph product, median graph, chemical graph theory
Evaluation (rules)
source: COBISS
Evaluation of bibliographic research performance indicators according to ARIS methodology
Citations Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
source: WoS source: Scopus source: COBISS
Researchers (5)
no. Code Name and surname Research area Role Period No. of publications
1.  17005  PhD Boštjan Brešar  Mathematics  Researcher  1998 - 2001  403 
2.  05949  PhD Sandi Klavžar  Mathematics  Head  1999 - 2001  1,177 
3.  08727  PhD Uroš Milutinović  Mathematics  Researcher  1999 - 2001  348 
4.  11666  PhD Aleksander Vesel  Computer intensive methods and applications  Researcher  1998 - 2001  339 
5.  15571  PhD Blaž Zmazek  Mathematics  Researcher  1998 - 2001  253 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,223 
Abstract
Graph products, their invariants and related topics will be considered. Median graphs will also be studied with emphasis on recognition problem. Metric graph theory will be applied in chemical graph theory for computing several topological invariants. We will also consider clique-gated graphs and the problem of computing the smallest number of linear forests.
Confirmation required
Views history
Favourite