A5009207700- graph theory and CDMA systems
- Finite Group Theory Research
- Advanced Graph Theory Research
- Graph theory and applications
- Graph Labeling and Dimension Problems
- Coding theory and cryptography
- Computational Geometry and Mesh Generation
- Advanced Combinatorial Mathematics
- Mathematics and Applications
- Synthesis and Properties of Aromatic Compounds
- History and advancements in chemistry
- Limits and Structures in Graph Theory
- Computational Drug Discovery Methods
- Fullerene Chemistry and Applications
- Geometric and Algebraic Topology
- Interconnection Networks and Systems
- Topological and Geometric Data Analysis
- Graph Theory and Algorithms
- Digital Image Processing Techniques
- Advanced Numerical Analysis Techniques
- Bacteriophages and microbial interactions
- Graphene research and applications
- Machine Learning in Bioinformatics
- RNA and protein synthesis mechanisms
- Glycosylation and Glycoproteins Research
Institute of Mathematics, Physics, and Mechanics
2014-2025
University of Primorska
2016-2025
University of Ljubljana
2012-2022
National and University Library of Slovenia
2021
University of Malta
2019
University of Mons
2019
University of Sheffield
2019
Institute of Information Technologies
2019
Ghent University Hospital
2019
Northeastern University
2012
Knots are some of the most remarkable topological features in nature. Self-assembly knotted polymers without breaking or forming covalent bonds is challenging, as chain needs to be threaded through previously formed loops an exactly defined order. Here we describe principles guide folding highly single-chain DNA nanostructures demonstrated on a nano-sized square pyramid. Folding knots encoded by arrangement modules different stability based derived and kinetic rules. Among designs composed...
The so-called leapfrog transformation that was first introduced for fullerenes (trivalent polyhedra with 12 pentagonal faces and all other hexagonal) is generalised to general maps on surfaces. All spherical can be classified according their order. A polyhedron said of Clar type if there exists a set cover each vertex exactly once. It shown fullerence only it transform another fullerene. Several basic transformations are defined by means which the accomplished.
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles arbitrary length in contemporary discrete applied mathematics which neither the authors nor readers incur any costs.
A graph is called a nut if zero its eigenvalue of multiplicity one and corresponding eigenvector has no entries. bicirculant it admits an automorphism with two equally sized vertex orbits. There are four classes connected quartic graphs. We classify the graphs that by investigating properties each these classes.
The Gray configuration is a (27_3) which typically realized as the points and lines of 3 x integer lattice. It occurs member an infinite family configurations defined by Bouwer in 1972. Since their discovery, both its Levi graph (i.e., point-line incidence graph) have been subject intensive study. Its automorphism group contains cyclic subgroups isomorphic to Z_3 Z_9, so it natural ask whether can be plane with any corresponding rotational symmetry. In this paper, we show that there are two...
We consider the class of I-graphs I(n,j,k), which is a generalization over generalized Petersen graphs. study different properties I-graphs, such as connectedness, girth, and whether they are bipartite or vertex-transitive. give an efficient test for isomorphism characterize automorphism groups I-graphs. Regular graphs with girth at least 6 can be considered Levi some symmetric combinatorial configurations. configurations that arise from Some them realized in plane cyclic astral...
An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on flags, with adjacent flags lying in different orbits. In this paper, we describe a method for constructing finite n-polytopes, by seeking particular normal subgroups the orientation-preserving subgroup an n-generator Coxeter (having property that not normalized any reflection and therefore full group). This technique used identify smallest examples 3- 4-polytopes, both self-dual non-self-dual...
Abstract Let G(n, d) denote a connected regular bipartite graph on 2 n vertices and of degree d. It is proved that any Cartesian product × G 1 ( , d ) ⃛ m ), such max { ,…, } ≤ + has quadrilateral embedding, thereby establishing its genus, generalizing result White. also if maximum D Q the ‐cube graph, ≥ then embedding.
Some graph invariants can be computed by summing certain values, called edge-contributions over all edges of graphs. In this note we use to study relationships among three invariants, also known as topological indices in mathematical chemistry: Wiener index, Szeged index and recently introduced revised index. We the quotient between tree-likeness
Two definitions of the problem graph drawing are considered, and an analytical solution is provided for each them. The solutions obtained make use eigenvectors Laplacian matrix a related structure. procedures give good results symmetrical graphs, they have already been used fullerene molecules in literature. analysis characterizes precisely what problems two solving. It also illuminates why can perform unsatisfactorily on asymmetrical graphs.
In the tight-binding source and sink potential model of transmission in single-molecule pi-conjugated conductors, vanishing opacity polynomial defines a necessary condition for zero conductance at given energy. Theorems are calculating polynomials composite devices terms characteristic subunits. These relations rationalize positions shapes zeros curves consisting molecules with side chains or units assembled series take an especially simple form polymeric identical repeat units.