Results 241 to 250 of about 1,191,800 (264)

On the maximum degree of minimum spanning trees

Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that under the Lp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball; we show an even tighter bound for MSTs where the maximum degree is minimized.
Gabriel Robins, Jeffrey S. Salowe
openaire   +1 more source

On Maximum Degree and Maximum Reverse Degree Energies of Splitting and Shadow graph of Complete graph

Utilitas Mathematica
In this paper, the relations of maximum degree energy and maximum reserve degree energy of a complete graph after removing a vertex have been shown to be proportional to the energy of the complete graph. The results of splitting the graph and shadow graphs are also presented for the complete graph after removing a vertex.
Arooj Ibrahim, Saima Nazeer
openaire   +2 more sources

Maximum degree and diversity in intersecting hypergraphs

Journal of Combinatorial Theory, Series B, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the maximum out-degree in random trees [PDF]

Australas. J Comb., 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amram Meir, John W. Moon
openaire   +1 more source

Independence, clique size and maximum degree

Combinatorica, 1984
Given a graph G with n vertices, maximum degree p, clique size (q-1), and independence number \(\alpha\), the author has previously shown that \(\alpha /n\geq 2/(p+q)\) [Proc. 9th Southeast. Conf. Comb., Graph Theory, Comput., Boca Raton 1978, 269-274 (1978; Zbl 0434.05044)].
openaire   +2 more sources

Plane Spanners of Maximum Degree Six

2010
We consider the question: "What is the smallest degree that can be achieved for a plane spanner of a Euclidean graph e?" The best known bound on the degree is 14. We show that e always contains a plane spanner of maximum degree 6 and stretch factor 6.
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas, Perkovic, Ljubomir   +3 more
openaire   +2 more sources

The maximum degree in a vertex-magic graph [PDF]

Australas. J Comb., 2004
Let \(G\) be a vertex-magic graph with \(v\) vertices, \(e\) edges and \(c\) components. In the paper it is proved that the maximum degree \(\Delta\) of \(G\) satisfies \(\Delta\leq \sqrt{(7e^2+(6c+5)e+c^2+3c)/v}-2\).
openaire   +1 more source

Extreme Wiener indices of trees with given number of vertices of maximum degree

Discrete Applied Mathematics, 2021
Zana Kovijanić Vukicevic, Vladimir Bozovic, Göran Popivoda   +2 more
exaly  

Injective edge coloring of graphs with maximum degree 5

Discrete Applied Mathematics, 2023
Junlei Zhu
exaly  

Graphs with maximum degreeΔ≥17and maximum average degree less than3are list2-distance(Δ+2)-colorable

Discrete Mathematics, 2014
Alexandre Pinlou
exaly