The codegree threshold ex 2 ( n , F ) $\operatorname{ex}_2(n, F)$ of a 3-graph $F$ is the minimum d = $d=d(n)$ such that every on $n$ vertices in which pair contained at least + 1 $d+1$ edges contains copy as subgraph. We study when K 4 − $F=K_4^-$ with 3 edges. Using flag algebra techniques, we prove if sufficiently large, then ⩽ . $$\begin{equation*} \hspace*{76pt}\operatorname{ex}_2(n, K_4^-...

We show that the kite graph $K_4^{(n)}$ uniquely maximizes distance spectral radius among all connected $4$-chromatic planar graphs on $n$ vertices.

Pengembangan teknologi di berbagai bidang dari tahun ke semakin pesat, begitu pula pengembangan kedirgantaraan. Salah satu pengembangannya adalah pesawat tanpa awak atau Unmanned Aerial Vehicle (UAV). Dalam penelitian ini, dilakukan analisis sistem dan desain kontrol pada model gerak lateral-direksional UAV menggunakan Output Feedback Control. Sistem bersifat tidak stabil, terkontrol, teramati....

Abstract We determine the maximum number of edges in a $$K_4$$ K 4 -minor-free n -vertex graph girth g , when $$g=5$$ g = 5 or is even. argue that there are many different extremal graphs if even ...