Results 11 to 20 of about 1,481,196 (275)

On $n$-norm preservers and the Aleksandrov conservative $n$-distance problem [PDF]

open access: yesAequationes mathematicae, 2015
The goal of this paper is to point out that the results obtained in the recent papers [7,8,10,11] can be seriously strengthened in the sense that we can significantly relax the assumptions of the main results so that we still get the same conclusions.
Gehér, Gy. P.
core   +8 more sources

n-Hosoya polynomials for Pentagonal Chains [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2013
The diameter, with respect to the n-distance of the graph  which represents a straight chain consisting of m pentagonal rings, is  obtained in this paper. The n-Hosoya polynomial of , for all m and n, where , is also obtained.
Ali Ali, Hadeel Meshw
doaj   +1 more source

The n-Hosoya Polynomial of 𝑊𝛼⊠ Cβ [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2012
For a wheel  and a cycle  the composite graphs ⊠  is constructed from the union of  and  and  adding the edges  and  , where  is an edge of  and is an edge of . The n – diameter , the  n – Hosoya polynomial and the n – Wiener index of  ⊠  are obtained in
Ahmed Ali, Haveen Ahmed
doaj   +1 more source

Working in the 21st Century. The Coronavirus Crisis: A Driver of Digitalisation, Teleworking, and Innovation, with Unintended Social Consequences

open access: yesInformation, 2021
(1) Background: This article seeks to shed a light on the innovation, digitalisation, and teleworking processes that have occurred because of the coronavirus crisis.
Antonio López Peláez   +3 more
doaj   +1 more source

On the best constants associated with n-distances

open access: yesActa Mathematica Hungarica, 2020
We pursue the investigation of the concept of $n$-distance, an $n$-variable version of the classical concept of distance recently introduced and investigated by Kiss, Marichal, and Teheux. We especially focus on the challenging problem of computing the best constant associated with a given $n$-distance. In particular, we define and investigate the best
Kiss, Gergely, Marichal, Jean-Luc
openaire   +6 more sources

On the new extension of distance-balanced graphs [PDF]

open access: yesTransactions on Combinatorics, 2016
‎In this paper‎, ‎we initially introduce the concept of n n-distance-balanced property which is considered as the generalized concept of distance-balanced property‎.
Morteza Faghani   +2 more
doaj   +3 more sources

On graphs with distance Laplacian eigenvalues of multiplicity n−4

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj   +1 more source

Mappings of preserving n-distance one in n-normed spaces [PDF]

open access: yesAequationes mathematicae, 2018
11 ...
Xujian Huang, Dongni Tan
openaire   +2 more sources

Acrylamide–Fat Correlation in Californian-Style Black Olives Using Near-Infrared Spectroscopy

open access: yesChemosensors, 2023
Californian-style is one of the most important black table olive elaborations. During its processing, table olives produce acrylamide, a potential carcinogen compound generated during sterilization.
Antonio Fernández   +4 more
doaj   +1 more source

Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders

open access: yesSIAM Journal on Computing, 2022
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in particular Ramanujan complexes.
Evra, Shai   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy