Results 31 to 40 of about 74,479 (279)
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
Resolving Combinatorial Ambiguities in Dilepton $t\bar t$ Event Topologies with Constrained $M_2$ Variables [PDF]
, 2017 We advocate the use of on-shell constrained $M_2$ variables in order to mitigate the combinatorial problem in SUSY-like events with two invisible particles at the LHC. We show that in comparison to other approaches in the literature, the constrained $M_2$
Debnath, Dipsikha +4 more
core +2 more sources
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
IEEE Access, 2021 The production of low-cost, small in size, and high in efficiency objects is the topic of research in almost all scientific fields, especially of engineering. In this scenario, nanotechnology becomes of great importance. To achieve these tasks, one needs
Ayesha Shabbir, Muhammad Azeem
doaj +1 more source
Resolving sets for Johnson and Kneser graphs [PDF]
, 2012 A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$.
Alberto Márquez +37 more
core +2 more sources
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source
Jurnal Matematika UNAND, 2019 Misalkan terdapat k partisi dengan himpunan terurut S = {S1, S2, ..., Sk} dari himpunan titik V (G) pada graf terhubung G = (V, E), representasi partisi v ∈ V terhadap S adalah koordinat r(v | S) dengan: r(v | S) = (d(v, S1), d(v, S2), ..., d(v, Sk ...
Muthia Muhana +2 more
doaj +1 more source
Refined dual stable Grothendieck polynomials and generalized Bender-Knuth involutions [PDF]
, 2015 The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and we prove that
Galashin, Pavel +2 more
core +3 more sources
Sensors, 2022 Long range (LoRa) is one of the most successful low-power wide-area networking technologies because it is ideally suited for long-distance, low-bit rate, and low-power communications in the unlicensed sub-GHz spectrum utilized for Internet of things (IoT)
Dick Mugerwa +4 more
doaj +1 more source
Coloring, location and domination of corona graphs [PDF]
, 2012 A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a ...
Aguilar, A. Rondón +2 more
core +4 more sources
PLoS ONE, 2021 What makes written text appealing? In this registered report protocol, we propose to study the linguistic characteristics of news headline success using a large-scale dataset of field experiments (A/B tests) conducted on the popular website Upworthy ...
Kristina Gligorić +3 more
doaj +1 more source