THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (Q4956581): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH
Property / DOI
 
Property / DOI: 10.22044/jas.2020.8343.1408 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3139055471 / rank
 
Normal rank
Property / title
 
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (English)
Property / title: THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (English) / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.07527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using determining sets to distinguish Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing number and distinguishing index of natural and fractional powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying graph automorphisms using determining sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small label classes in 2-distinguishing labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the augmented cube and hypercube powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian products of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list distinguishing number equals the distinguishing number for interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing graphs with intermediate growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the distinguishing number of infinite graphs and permutation groups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.22044/JAS.2020.8343.1408 / rank
 
Normal rank

Latest revision as of 15:25, 30 December 2024

scientific article; zbMATH DE number 7389794
Language Label Description Also known as
English
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH
scientific article; zbMATH DE number 7389794

    Statements

    Identifiers