SavedAdd your journal

Journals / Konuralp Journal of Mathematics / 2026 / Volume: 9 Issue: 1

On The Basic Properties of Linear Graphs - I

Ramazan Sunar(1Institite of Science and Technology, Eskişehir Osmangazi University,Eskişehir,Turkey)0000-0001-8107-5618
İbrahim Günaltılı(ESKİŞEHİR OSMANGAZİ ÜNİVERSİTESİ, FEN-EDEBİYAT FAKÜLTESİ)
Pages
—
Publication Date
2021-04-28
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this paper, we determined basic properties of finite linear graph.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A linear graph is a bipartite graph with parts $\mathcal{P}$ and $\mathcal{L}$ that have propertites: LG1: Any two distinct vertices of $\mathcal{P}$ have exactly common neighbour one vertex.
📊
Key Findings & Data:LG2: $\delta(G)\geq 2$.
💡
Conclusion & Impact:In this paper, we determined basic properties of finite linear graph.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:common neigborhood · linear graph · bipartite graph

Abstract

A linear graph is a bipartite graph with parts $\mathcal{P}$ and $\mathcal{L}$ that have propertites: LG1: Any two distinct vertices of $\mathcal{P}$ have exactly common neighbour one vertex. LG2: $\delta(G)\geq 2$. In this paper, we determined basic properties of finite linear graph.

🔖

Cite This Article

Sunar, R., Günaltılı, İ. (2021). On The Basic Properties of Linear Graphs - I. Konuralp Journal of Mathematics, Volume: 9 Issue: 1. https://ajindex.com/articles/1521625

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (10)

  1. A.S. Asratian, T.M.J. Denley and R. Hoggkvist, Bipartite graphs and their applications, Cambridge Uni. Press,1998, United Kingdom.
  2. L.M. Batten, Combinatorics of finite geometries,Cambridge University Press, Cambridge-NewYork, 1986.
  3. I. Gunaltılı, A. Ulukan, and S¸. Olgun, Some Properties Of Fınıte f0,1g-Graphs, Konualp Journal Of Mathematics,1(1), 2013, 34-39.
  4. I. Gunaltılı, Classification Of Some f0,1g-Semigraphs, Internation Journal of Innovative Research in Computer Science & Technology,4(1),2016,10-12.
  5. F. Harary, D. Hsu and Z. Miller, The biparticity of a graph, J. Graph Theory 1, 1977, 131-133.
  6. M. Mulder,(0, l )-graph and n-cubes, Discrete mathematics 28, 1979, 179- 188.
  7. C. Vasudev, Combinatorics and Graph Theory, New Age Publications(Academic), India, 2007.
  8. D.B. West, Introduction to Graph Theory, Prentice-Hall, Englewood Clins, NJ, 1996.
  9. L.M. Batten, Combinatorics of finite geometries,Cambridge University Press, Cambridge-NewYork, 1986.
  10. I. Gunaltılı, A. Ulukan, and S¸. Olgun, Some Properties Of Fınıte f0,1g-Graphs, Konualp Journal Of Mathematics,1(1), 2013, 34-39.