Results 21 to 30 of about 418 (70)
Existence of Regular Nut Graphs for Degree at Most 11
Discussiones Mathematicae Graph Theory, 2020 A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 38, Page 1997-2017, 2004., 2004 For an ordered set W = {w1, w2, …, wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k‐vector cW(v) = (d(v, w1), d(v, w2), …, d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct codes with respect to W.
Varaporn Saenpholphat, Ping Zhang
wiley +1 more source
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
Frontiers in Physics, 2020 Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj +1 more source
Intelligent Systems for Structural Damage Assessment
Journal of Intelligent Systems, 2018 This research provides a comparative study of intelligent systems in structural damage assessment after the occurrence of an earthquake. Seismic response data of a reinforced concrete structure subjected to 100 different levels of seismic excitation are ...
Vrochidou Eleni +3 more
doaj +1 more source
The agreement distance of rooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance.
Jonathan Klawitter
doaj +1 more source
Molecular Properties of Symmetrical Networks Using Topological Polynomials
Open Chemistry, 2019 A numeric quantity that comprehend characteristics of molecular graph Γ of chemical compound is known as topological index. This number is, in fact, invariant with respect to symmetry properties of molecular graph Γ.
Wang Xing-Long +5 more
doaj +1 more source
Finite-dimensional Zinbiel algebras and combinatorial structures
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel +2 more
doaj +1 more source
Laplacian energy and first Zagreb index of Laplacian integral graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul +2 more
doaj +1 more source
Topological Indices of Para-line Graphs of V-Phenylenic Nanostructures
Open Mathematics, 2019 The degree-based topological indices are numerical graph invariants which are used to correlate the physical and chemical properties of a molecule with its structure.
Nadeem Imran +3 more
doaj +1 more source
The Sanskruti index of trees and unicyclic graphs
Open Chemistry, 2019 The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighbors of a ...
Deng Fei +6 more
doaj +1 more source