Results 1 to 10 of about 4,548,119 (322)
On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree [PDF]
Journal of Inequalities and Applications, 2017 In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj +2 more sources
Bounding the maximum likelihood degree [PDF]
Mathematical Research Letters, 2015 Maximum likelihood estimation is a fundamental computational problem in statistics. In this note, we give a bound for the maximum likelihood degree of algebraic statistical models for discrete data.
Budur, Nero, Wang, Botong
core +3 more sources
Local Boxicity, Local Dimension, and Maximum Degree
Discrete Mathematics, 2019 In this paper, we focus on two recently introduced parameters in the literature, namely `local boxicity' (a parameter on graphs) and `local dimension' (a parameter on partially ordered sets). We give an `almost linear' upper bound for both the parameters
Majumder, Atrayee, Mathew, Rogers
core +3 more sources
Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
Discussiones Mathematicae Graph Theory, 2013 A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours.
Fiedorowicz Anna
doaj +2 more sources
Maximum likelihood degree of surjective rational maps
Arnold Mathematical Journal, 2018 We compute the ML degree associated with a surjective rational map.Comment: 2 pages; ps-format is most user ...
Karzhemanov, Ilya
core +2 more sources
On chromatic vertex stability of 3-chromatic graphs with maximum degree 4 [PDF]
Discrete Mathematics Letters, 2022 Martin Knor +2 more
doaj +3 more sources
Wiener index in graphs with given minimum degree and maximum degree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n \choose 2}$ on ...
Peter Dankelmann, Alex Alochukwu
doaj +1 more source
K-regular decomposable incidence structure of maximum degree [PDF]
Mathematica Moravica, 2023 This paper discusses incidence structures and their rank. The aim of this paper is to prove that there exists a regular decomposable incidence structure J = (P, B) of maximum degree depending on the size of the set and a predetermined rank.
Stošović Dejan +2 more
doaj +1 more source
Fractional Chromatic Number, Maximum Degree, and Girth [PDF]
SIAM Journal on Discrete Mathematics, 2021 We introduce a new method for computing bounds on the independence number and fractional chromatic number of classes of graphs with local constraints, and apply this method in various scenarios. We establish a formula that generates a general upper bound for the fractional chromatic number of triangle-free graphs of maximum degree~$ \ge 3$. This upper
Pirot, François +1 more
openaire +4 more sources
Proximity, remoteness and maximum degree in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the average ...
Peter Dankelmann +2 more
doaj +1 more source