Boolean rank of upset tournament matrices
Linear Algebra and its Applications, ISSN: 0024-3795, Vol: 436, Issue: 9, Page: 3239-3246
2012
- 1Citations
- 40Usage
- 2Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations1
- Citation Indexes1
- Usage40
- Abstract Views40
- Captures2
- Readers2
Article Description
The Boolean rank of an m×n (0,1) -matrix M is the minimum k for which matrices A and B exist with M=AB, A is m×k, B is k×n, and Boolean arithmetic is used. The intersection number of a directed graph D is the minimum cardinality of a finite set S for which each vertex v of D can be represented by an ordered pair (Sv,Tv) of subsets of S such that there is an arc from vertex u to vertex v in D if and only if Su∩Tv≠Ø. The intersection number of a digraph is equal to the Boolean rank of its adjacency matrix. Using this fact, we show that the intersection number of an upset tournament, equivalently, the Boolean rank of its adjacency matrix, is equal to the number of maximal subpaths of certain types in its upset path.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0024379511007397; http://dx.doi.org/10.1016/j.laa.2011.11.003; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84857993480&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0024379511007397; https://api.elsevier.com/content/article/PII:S0024379511007397?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0024379511007397?httpAccept=text/plain; https://digitalcommons.usu.edu/mathsci_facpub/179; https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=1317&context=mathsci_facpub; https://dx.doi.org/10.1016/j.laa.2011.11.003
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know