Results 21 to 30 of about 95 (92)

Power Domination in the Generalized Petersen Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
The problem of monitoring an electric power system by placing as few measurement devices in the system can be formulated as a power dominating set problem in graph theory.
Zhao Min, Shan Erfang, Kang Liying
doaj   +1 more source

On the Two-Dimensional Version of the Sperner Lemma and Brouwer’s Theorem

open access: yesAnnales Mathematicae Silesianae, 2022
In this work the Brouwer fixed point theorem for a triangle was proved by two methods based on the Sperner Lemma. One of the two proofs of Sperner’s Lemma given in the paper was carried out using the so-called index.
Barcz Eugeniusz
doaj   +1 more source

Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J.   +4 more
doaj   +1 more source

The agreement distance of unrooted phylogenetic networks [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj   +1 more source

On Topological Indices of mth Chain Hex-Derived Network of Third Type

open access: yesFrontiers in Physics, 2020
In theoretical chemistry, the numerical parameters that are used to characterize the molecular topology of graphs are called topological indices. Several physical and chemical properties like boiling point, entropy, heat formation, and vaporization ...
Yuhong Huo   +5 more
doaj   +1 more source

Intelligent Systems for Structural Damage Assessment

open access: yesJournal 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

Existence of Regular Nut Graphs for Degree at Most 11

open access: yesDiscussiones 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

Counting occurrences of 132 in an even permutation

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 25, Page 1329-1341, 2004., 2004
We study the generating function for the number of even (or odd) permutations on n letters containing exactly r ≥ 0 occurrences of a 132 pattern. It is shown that finding this function for a given r amounts to a routine check of all permutations in 𝔖2r.
Toufik Mansour
wiley   +1 more source

Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)

open access: yesFrontiers 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

Conditional resolvability in graphs: a survey

open access: yesInternational 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

Home - About - Disclaimer - Privacy