Elusiveness of finding degrees

DOI10.1016/J.DAM.2019.06.009MaRDI QIDQ2201777zbMATH OpenOpenAlexWikidataFDO

Authors Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman

Publication date 17 September 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.06.009

zbMATH Keywords

maximum degree\(k\)-degreeelusiveadversary arguments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Recommendations

• Elusiveness of finding degrees
• Tight bounds for finding degrees from the adjacency matrix
• The complexity of finding certain trees in tournaments
• Finding Scores in Tournaments
• Finding cliques using few probes

Cites work

• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• A lower bound for the recognition of digraph properties
• Complete subgraphs are elusive
• Elusiveness of finding degrees
• Evasiveness of graph properties and topological fixed-point theorems
• Finding Scores in Tournaments
• On recognizing graph properties from adjacency matrices
• Perfectness is an Elusive Graph Property

Cited in

(3)

• Tight bounds for finding degrees from the adjacency matrix
• Elusiveness of finding degrees
• Query complexity of tournament solutions

This page was built for publication: Elusiveness of finding degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201777)