Results 1 to 10 of about 428 (71)
Span of a Graph: Keeping the Safety Distance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Inspired by Lelek's idea from [Disjoint mappings and the span of spaces, Fund. Math. 55 (1964), 199 -- 214], we introduce the novel notion of the span of graphs.
Iztok Banič, Andrej Taranenko
doaj +1 more source
On vertex PI index of certain triangular tessellation networks
Main Group Metal Chemistry, 2021 The Wiener index, due to its many applications is considered to be one of very important distance-based index. But the Padmaker-Ivan (PI) index is kind of the only distance related index linked to parallelism of edges.
Bokhary Syed Ahtsham Ul Haq, Adnan
doaj +1 more source
Computational and topological properties of neural networks by means of graph-theoretic parameters
Alexandria Engineering Journal, 2023 A neural network is a computer system modeled on the nerve tissue and nervous system. In this sense, neural networks refer to systems of neurons, either organic or artificial in nature.
Asad Khan +5 more
doaj +1 more source
The Compared Costs of Domination Location-Domination and Identification
Discussiones Mathematicae Graph Theory, 2020 Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V, let Br(v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V, we have Br(v) ∩ C ≠ ∅; it is an r-locating-dominating code
Hudry Olivier, Lobstein Antoine
doaj +1 more source
Power Domination in the Generalized Petersen Graphs
Discussiones 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
Axioms for consensus functions on the n-cube [PDF]
, 2016 An elementary general result is proved that allows for simple characterizations of well-known location/consensus functions (median, mean and center) on the n-cube.
Garcia-Martinez, C. +3 more
core +3 more sources
Under which conditions is λ″(G)=κ″(L(G))?
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Farnaz Soliemany +2 more
doaj +1 more source
On the Two-Dimensional Version of the Sperner Lemma and Brouwer’s Theorem
Annales 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
Some Characteristics of the Prime Graph of Integer Modulo Groups
InPrime, 2023 The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are ...
Muklas Maulana +3 more
doaj +1 more source
The skew energy of random oriented graphs [PDF]
, 2013 Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the ...
Chen, Xiaolin +2 more
core +1 more source