THE BASES OF PRIMITIVE NON-POWERFUL COMPLETE SIGNED GRAPHS

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

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

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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• 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)