Results 11 to 20 of about 439,654 (264)

Identifying Codes in Line Graphs [PDF]

open access: yesJournal of Graph Theory, 2012
AbstractAn identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbors within the code. We study the edge‐identifying code problem, i.e. the identifying code problem in line graphs.
Florent Foucaud   +4 more
openaire   +3 more sources

The Compared Costs of Domination Location-Domination and Identification

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

Parent-Identifying Codes

open access: yesJournal of Combinatorial Theory, Series A, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Eldar Fischer, Mario Szegedy
openaire   +2 more sources

Identifying codes of cycles

open access: yesEuropean Journal of Combinatorics, 2006
We deal with identifying codes in cycles and show that for all \(r\geq 1\), any \(r\)-identifying code of the cycle \({\mathcal C}_n\) has cardinality at least \(\text{gcd}(2r+1,n)\left\lceil\frac{n}{2\text{gcd}(2r+1,n)}\right\rceil\).. This lower bound is enough to solve the case \(n\) even (which was already solved in [\textit{N. Bertrand, I. Charon,
Gravier, Sylvain   +2 more
openaire   +2 more sources

TECHNOLOGY OF IDENTIFYING ANTIPATTERNS IN ANDROID PROJECTS WRITTEN IN KOTLIN LANGUAGE

open access: yesВісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технології, 2020
The problem of the lack of instruments for identifying the characteristics of low-quality code in Android projects that are written in the Kotlin language is determined.
Ivan Yuriyovich Malik   +3 more
doaj   +1 more source

ANALYSIS OF CODE-SWITCHING AND CODE-MIXING USED IN RINTIK SEDU YOUTUBE CHANNEL’S VIDEO

open access: yesPrasasti: Journal of Linguistics, 2022
Rintik Sedu is an Indonesian writer's YouTube channel named Nadhifa Allya Tsana. As the content creator, Tsana masters Indonesian English and studies Korean self-taught.
Made Rahayu Sai Maheswara
doaj   +1 more source

Constructions of r-identifying codes and (r, ≤ l)-identifying codes

open access: yesIndian Journal of Pure and Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dhanalakshmi, R., Durairajan, C.
openaire   +3 more sources

An external validation of coding for childhood maltreatment in routinely collected primary and secondary care data

open access: yesScientific Reports, 2023
Validated methods of identifying childhood maltreatment (CM) in primary and secondary care data are needed. We aimed to create the first externally validated algorithm for identifying maltreatment using routinely collected healthcare data.
Ann John   +7 more
doaj   +1 more source

Identifying and prioritizing the factors affecting the Iranian Sports Refereeing Ethics Code

open access: yesSport TK, 2021
The purpose of this research was to compile a sports refereeing ethics code in Iran. The method of the present research was mixed (qualitative and quantitative).
Ahdieh Sadeghi Kalani   +3 more
doaj   +1 more source

Edge identifying codes

open access: yesElectronic Notes in Discrete Mathematics, 2011
Abstract We study the edge identifying code problem, i.e. the identifying code problem in line graphs. If γ ID ( G ) denotes the size of a minimum identifying code of a graph G , we show that the usual bound γ ID ( G ) ⩾ ⌈ log 2 ( n + 1 ) ⌉ , where n denotes the order of G , can be improved to Θ ( n )
Florent Foucaud   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy