Results 231 to 240 of about 1,191,800 (264)
Some of the next articles are maybe not open access.
Decreasing the maximum degree of a graph
Discrete Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Maximum Degree of a Random Graph
Combinatorics, Probability and Computing, 2000Let 0 < p < 1, q = 1 − p and b be fixed and let G ∈ [Gscr ](n, p) be a graph on n vertices where each pair of vertices is joined independently with probability p. We show that the probability that every vertex of G has degree at most pn + b √npq is equal to (c + o(1))n, for c = c(b) the root of a certain equation.
Oliver Riordan, Alex Selby
openaire +2 more sources
The Maximum Degree of Random Planar Graphs
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012Summary: \textit{C. McDiarmid} and \textit{B. A. Reed} [Comb. Probab. Comput. 17, No. 4, 591--601 (2008; Zbl 1160.05018)] showed that the maximum degree \(\Delta _n\) of a random labeled planar graph with \(n\) vertices satisfies with high probability (w.h.p.) \[ c_1 \log n < \Delta_n
Drmota, M. +4 more
openaire +2 more sources
Maximum Degree Condition and Group Connectivity
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoxia Zhang, Xiangwen Li
openaire +1 more source
On the Maximum Degree of an LCP Map
Mathematics of Operations Research, 1990The Linear Complementarity Problem can be shown to be equivalent to inverting a certain piecewise linear mapping. We give bounds on the degree of this mapping and present a class of matrices that generates maps of high degree.
openaire +1 more source
On the Maximum Value of the Maximum Degree of Kinematic Chains
Journal of Mechanisms, Transmissions, and Automation in Design, 1987One of the major steps in the development of a systematic design methodology for the creative design of vehicle mechanisms is to obtain all possible link assortments, and then to generate the catalogs of kinematic chains. If the generalized mathematical expressions for the maximum value M of the maximum number of joints incident to a link of kinematic ...
Hong-Sen Yan, Frank Harary
openaire +1 more source
SEMIGROUPS WITH MAXIMUM COMMUTING REGULARITY DEGREE
JP Journal of Algebra, Number Theory and Applications, 2017Summary: The commuting regularity degree, \(\mathrm{dcr}(S)\) of a non-group semigroup \(S\) is defined and studied recently by the authors [Creat. Math. Inform. 24, No. 1, 43--47 (2015; Zbl 1349.20044)], where \(\mathrm{dcr}(S)\) is the probability that a pair \((x,y)\) of the elements of \(S\) is a commuting regular pair (the pair \((x,y)\) is called
Firuzkuhy, A., Doostie, H.
openaire +2 more sources
Maximum degree in graphs of diameter 2
Networks, 1980AbstractIt is well known that there are at most four Moore graphs of diameter 2, i.e., graphs of diameter 2, maximum degree d, and d2 + 1 vertices. The purpose of this paper is to prove that with the exception of C4, there are no graphs of diameter 2, of maximum degree d, and with d2 vertices.
Paul Erdös +2 more
openaire +2 more sources
2001
The generalized maximum degree \(\Delta_k(G)\) of a graph \(G\) of order \(n\geq k\) is the maximum cardinality of the union of the neighbourhoods of \(k\) of its vertices. The authors study bounds on \(\Delta_k(G)\) in terms of the order \(n\), the maximum degree \(\Delta(G)=\Delta_1(G)\) and the total domination number of \(G\).
Haynes, Teresa W., Markus, Lisa R.
openaire +1 more source
The generalized maximum degree \(\Delta_k(G)\) of a graph \(G\) of order \(n\geq k\) is the maximum cardinality of the union of the neighbourhoods of \(k\) of its vertices. The authors study bounds on \(\Delta_k(G)\) in terms of the order \(n\), the maximum degree \(\Delta(G)=\Delta_1(G)\) and the total domination number of \(G\).
Haynes, Teresa W., Markus, Lisa R.
openaire +1 more source
2021
Summary: In this paper, maximum degree energy of graphs is studied. After giving some preliminary new results, bounds for the maximum degree eigenvalues are obtained for a general graph. Also bounds on the maximum degree eigenvalues of some frequently used graph classes are given by means of combinatorial, number theoretical and analysis methods.
CANGÜL, İSMAİL NACİ +3 more
openaire +2 more sources
Summary: In this paper, maximum degree energy of graphs is studied. After giving some preliminary new results, bounds for the maximum degree eigenvalues are obtained for a general graph. Also bounds on the maximum degree eigenvalues of some frequently used graph classes are given by means of combinatorial, number theoretical and analysis methods.
CANGÜL, İSMAİL NACİ +3 more
openaire +2 more sources