Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Michael S. Cavers"'
Autor:
Michael S. Cavers
Publikováno v:
Linear Algebra and its Applications. 613:87-114
A polynomial (resp. matrix) is stable if all of its roots (resp. eigenvalues) have negative real parts. A sign (resp. nonzero) pattern A is a matrix with entries in { + , − , 0 } (resp. { ⁎ , 0 } ). If there exists a real stable matrix with patte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e18ac6f9491f5a450e864d857d9e98a2
https://doi.org/10.1016/j.laa.2020.12.015
https://doi.org/10.1016/j.laa.2020.12.015
Publikováno v:
Discrete Mathematics. 341:2431-2441
The distinguishing chromatic number of a graph, G , is the minimum number of colours required to properly colour the vertices of G so that the only automorphism of G that preserves colours is the identity. There are many classes of graphs for which t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dbecdb1ba752d21419d9cb0c4d93fbb
https://doi.org/10.1016/j.disc.2018.05.016
https://doi.org/10.1016/j.disc.2018.05.016
Autor:
Michael S. Cavers, Karen Seyffarth
Publikováno v:
Ars mathematica contemporanea
Let ?$H$? be a graph and let ?$k \geq \chi (H)$? be an integer. The ?$k$?-colouring graph of ?$H$?, denoted ?$G_k(H)$?, is the graph whose vertex set consists of all proper ?$k$?-vertex-colourings (or simply ?$k$?-colourings) of ?$H$? using colours ?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d077aa9f94dec699d0c5bbf7d303e598
http://www.dlib.si/details/URN:NBN:SI:doc-MTYTYNX7
http://www.dlib.si/details/URN:NBN:SI:doc-MTYTYNX7
Autor:
Michael S. Cavers, Kris Vasudevan
Publikováno v:
Nonlinear Processes in Geophysics, Vol 22, Iss 5, Pp 589-599 (2015)
Directed graph representation of a Markov chain model to study global earthquake sequencing leads to a time series of state-to-state transition probabilities that includes the spatio-temporally linked recurrent events in the record-breaking sense. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d033d2837642157e052c93a9b72809b
http://www.nonlin-processes-geophys.net/22/589/2015/npg-22-589-2015.pdf
http://www.nonlin-processes-geophys.net/22/589/2015/npg-22-589-2015.pdf
Autor:
Joseph M. Ling, Michael S. Cavers
Publikováno v:
Advanced Statistical Methods in Data Science ISBN: 9789811025938
Multiple-choice tests are extensively used in the testing of mathematics and statistics in undergraduate courses. This paper discusses a confidence weighting model of multiple choice testing called the student-weighted model. In this model, students
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa44b7f00cdf754df3866b20d3ffe75e
https://doi.org/10.1007/978-981-10-2594-5_9
https://doi.org/10.1007/978-981-10-2594-5_9
Publikováno v:
Linear Algebra and its Applications. 433:172-190
In this paper, we consider the energy of a simple graph with respect to its normalized Laplacian eigenvalues, which we call the L-energy. Over graphs of order n that contain no isolated vertices, we characterize the graphs with minimal L-energy of 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf1015510b9b9292e4c86c7c8f32afe8
https://doi.org/10.1016/j.laa.2010.02.002
https://doi.org/10.1016/j.laa.2010.02.002
Autor:
Michael S. Cavers
Publikováno v:
Linear and Multilinear Algebra. 58:257-267
A tool to study the inertias of reducible nonzero (resp. sign) patterns is presented. Sumsets are used to obtain a list of inertias attainable by the pattern 𝒜 ⊕ ℬ dependent upon inertias attainable by patterns 𝒜 and ℬ. It is shown that i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18c3c22a203f6b2e62c76d9c2e699f77
https://doi.org/10.1080/03081080802496156
https://doi.org/10.1080/03081080802496156
Publikováno v:
Linear Algebra and its Applications. 431(11):2024-2034
An n-by-n sign pattern A is a matrix with entries in {+,-,0}. An n-by-n nonzero pattern A is a matrix with entries in {∗,0} where ∗ represents a nonzero entry. A pattern A is inertially arbitrary if for every set of nonnegative integers n1,n2,n3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c2133b2082ba3a04bd289efc230366e
Autor:
Randall J. Elzinga, Sarah E. Vanderlinde, Kevin N. Vander Meulen, Michael S. Cavers, David A. Gregory
Publikováno v:
Discrete Mathematics. 308(15):3230-3240
We consider the minimum number of cliques needed to partition the edge set of D(G), the distance multigraph of a simple graph G. Equivalently, we seek to minimize the number of elements needed to label the vertices of a simple graph G by sets so that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df50508c0758799447c64626ba745766
Autor:
Michael S. Cavers, Jacques Verstraëte
Publikováno v:
Discrete Mathematics. 308:2011-2017
In this paper, we prove that for any forest [email protected]?K"n, the edges of E(K"n)@?E(F) can be partitioned into O(nlogn) cliques. This extends earlier results on clique partitions of the complement of a perfect matching and of a hamiltonian path
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1eec702f217d2eddf8bd68a3c9f01f2c
https://doi.org/10.1016/j.disc.2007.04.041
https://doi.org/10.1016/j.disc.2007.04.041