91. Edge-contributions of some topological indices and arboreality of molecular graphsTomaž Pisanski, Janez Žerovnik, 2009, original scientific article Abstract: Some graph invariants can be computed by summing certain values, called edge-contributions over all edges of graphs. In this note we use edge-contributions to study relationships among three graph invariants, also known as topological indices in mathematical chemistry: Wiener index, Szeged index and recently introduced revised Szeged index. We also use the quotient between the Wiener index and the revised Szeged index to study tree-likeness of graphs.
Keywords: mathematical chemistry, chemical graph theory, topological index, revised Szeged index
Published in RUP: 30.12.2021; Views: 2942; Downloads: 29
 Full text (158,93 KB) |
92. |
93. |
94. Allocating indivisible items with minimum dissatisfaction on preference graphsNina Chiarelli, Clément Jean Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Nevena Pivač, Ulrich Pferschy, 2021, published scientific conference contribution Keywords: fair division, partial order, preference graph
Published in RUP: 29.10.2021; Views: 3944; Downloads: 24
 Link to full text |
95. Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.Clément Jean Dallard, 2021, review, book review, critique Keywords: reconfiguration, dynamic programming, graph coloring
Published in RUP: 26.10.2021; Views: 3542; Downloads: 12
Link to full text |
96. |
97. |
98. |
99. |
100. |
