Results 11 to 20 of about 2,482 (203)

O nekim zanimljivim rezultatima postignutim u Hrvatskoj u području kemijske teorije grafova (On Some Interesting Results Achieved in Chemical Graph Theory in Croatia) [PDF]

open access: yesKemija u Industriji, 2006
Some interesting results achieved in chemical graph theory in Theoretical Chemistry Group at the Rugjer Bošković Institute are briefly reviewed. In the article are discussed the use of the Sachs theorem for the construction of the characteristic ...
Trinajstić, N.
doaj  

ON THE NUMBER OF INVERSION OUTCOMES OF THE PERMUTATION SCHEME AND ITS ANALYSIS WITH FIXED NUMBER OF INVERSIONS

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015
The numerical method of calculation of inversions in permutations uses themethod of graph theory. As the result we colculate the recurrence for colculation of the numbers of inversions with the use of the bunchs of graphs and finding the probability ...
Natalia Enatskaya
doaj   +1 more source

Permutation invariant Gaussian matrix models

open access: yesNuclear Physics B, 2019
Permutation invariant Gaussian matrix models were recently developed for applications in computational linguistics. A 5-parameter family of models was solved.
Sanjaye Ramgoolam
doaj   +1 more source

The improved hamming number method to detect isomorphism for kinematic chain with multiple joints

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2017
During the process of kinematic structure enumeration using graph theory, isomorphism identification of graphs is an important and complicated problem.
Wei SUN, Jianyi KONG, Liangbo SUN
doaj   +1 more source

An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops

open access: yesEntropy, 2020
Graph enumeration with given constraints is an interesting problem considered to be one of the fundamental problems in graph theory, with many applications in natural sciences and engineering such as bio-informatics and computational chemistry.
Naveed Ahmed Azam   +2 more
doaj   +1 more source

Convolutions of sets with bounded VC-dimension are uniformly continuous

open access: yesDiscrete Analysis, 2021
Convolutions of sets with bounded VC-dimension are uniformly continuous, Discrete Analysis 2021:1, 25 pp. In recent years there has been a cross-fertilization between combinatorics and model theory, as a result of the realization that certain model ...
Olof Sisask
doaj   +1 more source

Limits of Latin squares

open access: yesDiscrete Analysis, 2023
Limits of Latin squares, Discrete Analysis 2023:8, 66 pp. There has been a great deal of work over the last fifteen to twenty years on the theme of continuous limits of discrete combinatorial objects. In particular, any sequence of graphs of increasing
Frederik Garbe   +3 more
doaj   +1 more source

Large N expansion of the moments and free energy of Sachdev-Ye-Kitaev model, and the enumeration of intersection graphs

open access: yesJournal of High Energy Physics, 2018
In this paper we explain the relation between the free energy of the SYK model for N Majorana fermions with a random q-body interaction and the moments of its spectral density.
Yiyang Jia, Jacobus J. M. Verbaarschot
doaj   +1 more source

A Survey of Maximal k-Degenerate Graphs and k-Trees

open access: yesTheory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

Type Synthesis of Lower Mobility Parallel Mechanisms: A Review

open access: yesChinese Journal of Mechanical Engineering, 2019
Type synthesis of mechanisms aims to systematically determine all possible structures for a specific mobility requirement. Numerous methods based on different theories were proposed for type synthesis of lower mobility parallel mechanisms in past decades.
Wei Ye, Qinchuan Li
doaj   +1 more source

Home - About - Disclaimer - Privacy