Note on the negative decision number in digraphs

DOI10.7858/EAMJ.2014.025MaRDI QIDQ2950963zbMATH OpenOpenAlexFDO

Authors Hye Kyung Kim

Publication date 9 October 2015

Published in East Asian mathematical journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7858/eamj.2014.025

zbMATH Keywords

bad functionindegreenegative decision number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory (05C90)

Recommendations

• The modified negative decision number in graphs
• Negative \(k\)-subdecision numbers in graphs
• Lower negative decision number in a graph
• The negative decision number in graphs
• Some sharp bounds on the negative decision number of graphs

Cited in

(1)

• Lower negative decision number in a graph

This page was built for publication: Note on the negative decision number in digraphs

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