On the Halin Turán number of short cycles

Addisu Paulos

doi:10.59400/jam.v1i4.232

On the Halin Turán number of short cycles

Addisu Paulos Addis Ababa University, Addis Ababa 1000, Ethiopia

Article ID: 232

3030 Views, 2557 PDF Downloads

DOI: https://doi.org/10.59400/jam.v1i4.232

Keywords: halin graphs; turán number; halin turán number

Abstract

A Halin graph is a graph constructed by embedding a tree with no vertex of degree two in the plane and then adding a cycle to join the tree’s leaves. The Halin Turán number of a graph F , denoted as exH(n, F ), is the maximum number of edges in an n-vertex Halin graph. In this paper, we give the exact value of exH(n, C4), where C4 is a cycle of length 4. We also pose a conjecture for the Halin Turán number of longer cycles.

References

[1]Turán P. On an external problem in graph theory. Matematikai és Fizikai Lapok,1941,48:436–452.

[2]Mantel W. Problem 28. Wiskundige Opgaven, 10(60-61):320, 1907.

[3]Erdös P, Stone AH. On the structure of linear graphs. Bulletin of the American Mathematical Society. 1946, 52(12): 1087-1091. doi: https://doi.org/10.1090/s0002-9904-1946-08715-7

[4]Erdős P and Simonovits M. A limit theorem in graph theory. Studia Scientiarum Mathematicarum Hungarica, 1965.

[5]Dowden C. ExtremalC4-Free/C5-Free Planar Graphs. Journal of Graph Theory. 2015, 83(3): 213-230. doi: https://doi.org/10.1002/jgt.21991

[6]Lan Y, Shi Y, Song ZX. Extremal Theta-free planar graphs. Discrete Mathematics. 2019, 342(12): 111610. doi: https://doi.org/10.1016/j.disc.2019.111610

[7]Ghosh D, Györi E, Martin RR, et al. Planar Turán Number of the 6-Cycle. SIAM Journal on Discrete Math- ematics. 2022, 36(3): 2028-2050. doi: https://doi.org/10.1137/21m140657x

[8]Lan Y, Shi Y, and Song ZX. Planar Turán number and planar anti-Ramsey number of graphs. Operations Research Transactions, 25(3), 2021.

[9]Cranston DW, Lidický B, Liu X, et al. Planar Turán Numbers of Cycles: A Counterexample. The Electronic Journal of Combinatorics. 2022, 29(3). doi: https://doi.org/10.37236/10774

[10]Győri E, Varga K, and Zhu X. A new construction for planar Turán number of cycle. arXiv:2304.05584, 2023.

[11]Lan Y and Song ZX. An improved lower bound for the planar Turán number of cycles. arXiv:2209.01312, 2022.

[12]Fang L, Zhai M. Outerplanar Turán numbers of cycles and paths. arXiv:2110.10410, 2021.

[13]Halin R. Studies on minimally n-connected graphs. Combinatorial Mathematics and its Applications, 129– 136, 1971.

[14]Hazewinkel M. Encyclopedia of Mathematics: An Annotated translation of the “Soviet” Mathematical En- cyclopedia, 281–281.

[15]Cornuéjols G, Naddef D, Pulleyblank WR. Halin graphs and the travelling salesman problem. Mathematical Programming. 1983, 26(3): 287-294. doi: https://doi.org/10.1007/bf02591867

[16]Bondy JA, Lovász L. Lengths of cycles in halin graphs. Journal of Graph Theory. 1985, 9(3): 397-410. doi: https://doi.org/10.1002/jgt.3190090311

[17]He S, Liu H. The maximum number of short paths in a Halin graph. Discrete Optimization. 2023, 50: 100809. doi: https://doi.org/10.1016/j.disopt.2023.100809

Published

2023-12-14

How to Cite

Paulos, A. (2023). On the Halin Turán number of short cycles. Journal of AppliedMath, 1(4), 232. https://doi.org/10.59400/jam.v1i4.232

Download Citation

Issue

Vol. 1 No. 4 (2023)

Section

Article

This work is licensed under a Creative Commons Attribution 4.0 International License.

Editor-in-Chief

Assoc. Prof. Ahmad Zeeshan

International Islamic University, Pakistan

eISSN

2972-4805

Publication Frequency

Bi-monthly

About the Publisher

Academic Publishing insists on taking academic exchange and publication as the main line, carrying out comprehensive management based on science and technology, and fully exploring excellent international publishing resources. Within 5 years, it will form a strategic framework and scale with science (S), technology (T), medicine (M), education (E), and humanities and arts (H) as the main publishing fields. Academic Publishing is headquartered in Singapore and based in Malaysia, with the United States and China providing the main scientific and academic resources. At the same time, it has established long-term good cooperative relations with other publishing companies, scientific research communities, and academic organizations in more than a dozen countries and regions. Academic Publishing uses English and Chinese as its main publishing languages, mainly publishing books, journals, and conference papers in print and online. The vast majority of publications follow the international open access policy, providing stable and long-term quality and professional publications. With the joint efforts of the expert team and our professional editorial team, our publications will gradually be indexed by international databases in stages to provide convenient and professional retrieval for various scholars. At the same time, manuscripts we accept will be subject to the peer review principle, and cutting-edge and innovative research articles will be preferentially accepted for peer reference and discussion. All kinds of our publications are welcome for peer to contribute, access, and download.

more

Volume Arrangement

2024

2023

Featured Articles

Octagonal-square tessellation model for masting GSM network: A case study of MTN Kumasi-East, Ghana

Masting in GSM network design is one of the most challenging problems in cell planning. The effect of uniform design pattern has been proven geographically to be hexagonal using uniform cell range. In this paper, we present a new uniform greedy semi-regular tessellation model called the octagonal square tessellation model (OSTM) to address the problem of global minimum overlap difference and area. Data from MTN Kumasi-East Ghana was collected and analyzed using the developed model. The original layout for the 0.6 km cell range accounted for an overlap difference of 937.66 m and a total area of 21.41 km² for 50 GSM mosts whereas the OSTM model accounted for an overlap difference of 1316.95 m with an area of 34.23 km². This is a 59.87% reduction of the original total area. Our solution is shown to be optimal in overlap difference and area for non-uniform cell range.

Computation of topological indices of linear chains of perylene and coronene using M-polynomial

The M-polynomial yields degree based topological indices that anticipate different physical and chemical properties of material being scrutinized. In this work, M- polynomial of linear chains of perylene and coronene are acquired. From M-polynomial, some degree based topological dicriptors are determined. Some topological indices of these compounds are compared by plotting graphs.

H∞ hybrid control and MRD in a steel frame building subjected to excessivevibrations caused by the dynamic action of wind and earthquake

The dynamic loads from earthquakes and winds can destroy lives, cause collapse in civil structures, and interrupt basic services provided to the population. In this scenario, structural designs must be developed to decrease the damage induced by these actions. The objective of this work is to design a hybrid controller based on the H∞ optimization via state feedback and the magneto-rheological damper (MRD) to mitigate the excessive vibrations of a three-story steel frame building, represented through the shear building model, subjected to the simultaneous dynamic action of wind and earthquake. All research is based on computational simulation, experimental research and results will not be addressed. In the numerical analysis, digital computer and MATLAB® software are used, and implemented codes generate the expected results based on the mathematical modeling. With the application of the H∞ control technique via state feedback, the displacements were reduced by 77%. With MRD this reduction was 79%. With the hybrid controller, this reduction was 100%. Thus, the verifications in relation to maximum displacements were met for NBR 15421:2006, NBR 8800:2008 and NBR 6118:2014. From the results, it is concluded that the hybrid controller proved to be more efficient and achieved the proposed objective. The exogenous inputs had zero influence on the behavior of the system output.

Topological analysis of multiple tables

The paper proposes a topological approach in order to explore several data tables simultaneously. These data tables of quantitative and/or qualitative variables measured on different homogeneous themes, collected from the same individuals. This approach, called topological analysis of multiple tables (TAMT), is based on the notion of neighborhood graphs in the context of a joint analysis of several data tables. It allows the simultaneous study of possible links between several thematic tables. The structure of the correlations or associations of the variables in each thematic table is analyzed according to quantitative, qualitative or mixed variables considered. Like the multiple factorial analysis (MFA), the TAMT allows several tables of variables to be analyzed simultaneously, and to obtain results, in particular graphical representations, which make it possible to study the relationship between individuals, variables and tables of data. These can also be tables of temporal data, collected at different times on the same individuals. The proposed TAMT approach is illustrated using real data associated with several and different homogeneous themes. Its results are compared to those from the MFA method.

Development of a stacked hybrid Decision Tree model leveraging the NSL-KDD dataset

Intrusion detection in information technology as well as operational technology networks is highly required in modern day systems due to the increased spate of cyber-attacks in both number and complexity. Anomaly-based intrusion detection systems which have the capacity to detect novel or zero-day attacks are highly employed in this regard. One important component of anomaly-based intrusion detection systems which ensures their behaviour is artificial intelligence in general and machine learning in particular. The burden in modern day cybersecurity research is to investigate and develop models that can outperform existing ones. This paper is aimed at developing a hybrid decision tree model using the stacking ensemble approach. Performances were measured on the basis of recall, precision, accuracy, F1-score, receiver operating characteristics and confusion matrices. The hybrid model presented a precision of 97%, accuracy of 81%, F1-score of 80% and AUC score of 0.96, respectively.