Results 11 to 20 of about 48,603 (202)
Generalized Zagreb index of some dendrimer structures
Chemical graph theory, is a branch of mathematical chemistry which deals with the nontrivial applications of graph theory to solve molecular problem. A chemical graph is represent a molecule by considering the atoms as the vertices and bonds between them
Anita Pal +3 more
doaj +1 more source
Minimal graphs with respect to the multiplicative version of some vertex-degree-based topological indices [PDF]
As a real-valued function, a graphical parameter is defined on the class of finite simple graphs, and remains invariant under graph isomorphism. In mathematical chemistry, vertex-degree-based topological indices are the graph parameters of the general ...
Mehdi Eliasi
doaj +1 more source
Liftings and stresses for planar periodic frameworks [PDF]
We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology.
Borcea, Ciprian S., Streinu, Ileana
core +3 more sources
Dynamic Algorithms for the Massively Parallel Computation Model [PDF]
The Massive Parallel Computing (MPC) model gained popularity during the last decade and it is now seen as the standard model for processing large scale data. One significant shortcoming of the model is that it assumes to work on static datasets while, in
Italiano, Giuseppe F. +3 more
core +3 more sources
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter [PDF]
An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices
A. Schrijver +43 more
core +2 more sources
On the vv-degree based first Zagreb index of graphs
A topological index is a graph invariant applicable in chemistry. The first Zagreb index is a topological index based on the vertex degrees of molecular graphs. For any graph G, the first Zagreb index [Formula: see text] is equal to the sum of squares of
L. Anusha +2 more
doaj +1 more source
Computing Scalable Multivariate Glocal Invariants of Large (Brain-) Graphs
Graphs are quickly emerging as a leading abstraction for the representation of data. One important application domain originates from an emerging discipline called "connectomics". Connectomics studies the brain as a graph; vertices correspond to neurons (
Burns, Randal +8 more
core +1 more source
Planar Octilinear Drawings with One Bend Per Edge [PDF]
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A $
A. Garg +16 more
core +2 more sources
Status Connectivity Indices of Middle graph
Topological index is sometimes also known as graph theoretic index, is a numerical invariant of a graph, the topological indices are classified on degree and distance based concepts.
Roopa Subhas Naikar
doaj +1 more source
Bipartite stable Poisson graphs on R [PDF]
Let red and blue points be distributed on $\mathbb{R}$ according to two independent Poisson processes $\mathcal{R}$ and $\mathcal{B}$ and let each red (blue) point independently be equipped with a random number of half-edges according to a probability ...
Deijfen, Maria, Lopes, Fabio
core +1 more source

