✨
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ÜNALTILI, İ. (2021). On The Basic Properties of Linear Graphs - I. Konuralp Journal of Mathematics, Cilt: 9 - Sayı: 1, 154–158. https://ajindex.com/articles/786411