Results 41 to 50 of about 15,243 (160)
Molecular Topology Index of a Zero Divisor Graph on a Ring of Integers Modulo Prime Power Order
Contemporary Mathematics and Applications (ConMathA)In chemistry, graph theory has been widely utilized to address molecular problems, with numerous applications in graph theory and ring theory within this field.
Didit Satriawan +4 more
doaj +1 more source
Aquatic Invertebrates of the Devereux Slough - 2018 [PDF]
, 2020 In 2018, the hardscape construction of NCOS (North Campus Open Space), a restored wetland on the Northern border of COPR (Coal Oil Point Reserve), was completed, thus approximately doubling the overall size of the wetland and offering the rather unique ...
Peng, Victoria +2 more
core
On the Wiener complexity and the Wiener index of fullerene graphs
, 2019 Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex $v$ of a graph is the sum of distances from $v$ to all the other
Dobrynin, Andrey A., Vesnin, Andrei Yu.
core +1 more source
Cacti with Extremal PI Index [PDF]
, 2016 The vertex PI index $PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)]$ is a distance-based molecular structure descriptor, where $n_{xy}(x)$ denotes the number of vertices which are closer to the vertex $x$ than to the vertex $y$ and which has been the
Wang, Chunxiang +2 more
core +1 more source
Journal of Chemistry, 2019 In this paper, with respect to the Wiener index, hyper-Wiener index, and Harary index, it gives some sufficient conditions for some graphs to be traceable, Hamiltonian, Hamilton-connected, or traceable for every vertex.
Guisheng Jiang, Lifang Ren, Guidong Yu
doaj +1 more source
, 2012 Let $G$ be a connected graph with vertex set $V$ and a {\em weight function} $\rho$ that assigns a nonnegative number to each of its vertices. Then, the {\em $\rho$-moment} of $G$ at vertex $u$ is defined to be $M_G^{\rho}(u)=\sum_{v\in V} \rho(v)\dist ...
Dalfó, C., Fiol, M. A., Garriga, E.
core
Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
Applied Mathematics Letters, 2009 AbstractIn this work we show that among all n-vertex graphs with edge or vertex connectivity k, the graph G=Kk∨(K1+Kn−k−1), the join of Kk, the complete graph on k vertices, with the disjoint union of K1 and Kn−k−1, is the unique graph with maximum sum of squares of vertex degrees.
Behtoei, A., Jannesari, M., Taeri, B.
openaire +1 more source
Convolutional Deblurring for Natural Imaging
, 2019 In this paper, we propose a novel design of image deblurring in the form of one-shot convolution filtering that can directly convolve with naturally blurred images for restoration.
Hosseini, Mahdi S. +1 more
core +1 more source
On Distance-Based Topological Descriptors of Subdivision Vertex-Edge Join of Three Graphs
IEEE Access, 2019 The analysis of networks and graphs through topological descriptors carries out a useful role to derive their underlying topologies. This process has been widely used in biomedicine, cheminformatics, and bioinformatics, where assessments based on graph ...
Hong Yang +4 more
doaj +1 more source
Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs [PDF]
Journal of Chemical Information and Computer Sciences, 2002 The hyper-Wiener index WW of a graph G is defined as WW(G) = (summation operator d (u, v)(2) + summation operator d (u, v))/2, where d (u, v) denotes the distance between the vertices u and v in the graph G and the summations run over all (unordered) pairs of vertices of G.
Gordon, Cash +2 more
openaire +2 more sources