Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Smallest and largest binary sums of a graph

From MaRDI portal
Publication:3172495
Jump to:navigation, search

zbMATH Open1284.05159MaRDI QIDQ3172495FDOQ3172495


Authors: K. A. Vidya, B. Chaluvaraju, Remy Y. Denis Edit this on Wikidata


Publication date: 5 October 2011





Recommendations

  • Publication:3469124
  • Counting Binary Matrices with Given Row and Column Sums
  • Reverse binary graphs
  • On the range of size of sum graphs \& integral sum graphs of a given order
  • Some results on the spum and the integral spum of graphs


Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)



Cited In (1)

  • Title not available (Why is that?)





This page was built for publication: Smallest and largest binary sums of a graph

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3172495&oldid=16270164"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:54. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki