The bases of primitive non-powerful complete signed graphs

DOI10.11568/KJM.2014.22.3.491zbMATH Open1462.05166OpenAlexW1975990075MaRDI QIDQ5217536FDOQ5217536

Authors: Byung Chul Song, Byeong Moon Kim 

Publication date: 24 February 2020

Published in: Korean Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11568/kjm.2014.22.3.491

Recommendations

• The bases of a class of primitive non-powerful signed digraphs
• The primitive nonpowerful signed simple graphs with largest base
• An upper bound on the base of a special class of primitive nonpowerful symmetric signed digraphs
• BASE OF THE NON-POWERFUL SIGNED TOURNAMENT
• scientific article; zbMATH DE number 5850554

zbMATH Keywords

sign pattern matrixbasecomplete graph,

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Sign pattern matrices (15B35)

Cites Work

• Bounds on the bases of irreducible generalized sign pattern matrices
• Bounds on the \(k\)th multi-\(g\) base index of nearly reducible sign pattern matrices
• The local bases of primitive non-powerful signed symmetric digraphs with loops
• Title not available (Why is that?)

Cited In (4)

• The base of primitive non-powerful incomplete sign symmetric simple graphs
• Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs
• The primitive nonpowerful signed simple graphs with largest base
• BASE OF THE NON-POWERFUL SIGNED TOURNAMENT

This page was built for publication: The bases of primitive non-powerful complete signed graphs

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