Results 231 to 240 of about 34,690 (269)
A QSPR study of coronary artery disease drugs using eccentricity-based indices. [PDF]
Sci RepIqbal N +5 more
europepmc +1 more source
Extremal infinite graph theory
Discrete Mathematics, 2011 We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
Maya Stein
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Springer Optimization and Its Applications, 2022
Michael A Henning, Jan H van Vuuren
exaly +2 more sources
Michael A Henning, Jan H van Vuuren
exaly +2 more sources
On the applications of Extremal Graph Theory to Coding Theory and Cryptography
Electronic Notes in Discrete Mathematics, 2013 Abstract Explicit constructions in Extremal graph theory give appropriate lower bound for Turan type problems. In the case of prohibited cycles explicit constructions can be used in various problems of Information Security. We observe algebraic constructions of regular graphs of large girth and graphs with large cycle indicator and describe some ...
Monika Polak +2 more
exaly +2 more sources
On an extremal problem in graph theory [PDF]
Colloquium Mathematicum, 1964 Let \(l\) and \(p\) be integers such that \(l>p\). It is shown that there exists a constant \(\gamma_{p,l}\) such that if \(n>n_0(p,l)\) then every graph with \(n\) vertices and \([\gamma_{p,l}n^{2-1/p}]\) edges contains a subgraph \(H\) with the following property: the vertices of \(H\) may be labbeled \(x_1,...,x_l\) and \(y_1,...,y_l\) so that every
exaly +3 more sources
On a valence problem in extremal graph theory
Discrete Mathematics, 1973 Vorliegende Arbeit bezieht sich auf nicht-orientierte, Schlingen und mehrfache Kanten nicht enhaltende Graphen. Bezeichne \(L\) einen solchen vom vollständigen \(p\)-Graphen \(K_p\) verschiedenen \(p\)-chromatischen Graphen, welcher eine Kante \(e\) so enthält, daß \(L-e\) ein \((p-1)\)-chromatischer Graph ist. Als Hauptergebnis der vorliegenden Arbeit
M Simonovits
exaly +3 more sources
Three conjectures in extremal spectral graph theory
Journal of Combinatorial Theory Series B, 2017 We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of $P_2$ and $P_{n-2}$ is the unique graph of maximum spectral radius over all planar graphs. This was conjectured by Boots and Royle in 1991 and independently by Cao and Vince in 1993.
Michael Tait
exaly +4 more sources
An extremal problem in graph theory
Israel Journal of Mathematics, 1968It is proved that the maximum number of cut-vertices in a connected graph withn vertices andm edges is $$max\left\{ {q:m \leqq (_2^{n - q} ) + q} \right\}$$ All the extremal graphs are determined and the corresponding problem for cut-edges is also solved.
A Ramachandra Rao
exaly +3 more sources