Characterization of Some Graphs using Graph Equations

Beena S

doi:https://doi.org/10.14445/22315373/IJMTT-V65I4P501

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 4 | Year 2019 | Article Id. IJMTT-V65I4P501 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I4P501

Characterization of Some Graphs using Graph Equations

Beena S

Citation :

Beena S, "Characterization of Some Graphs using Graph Equations," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 4, pp. 1-3, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I4P501

Abstract

The line graph of a graph G denoted by L(G)is defined as the graph whose vertices are the edges of G and where two vertices in L(G) are adjacent if and only if the corresponding edges in G are incident to a common vertex. A connected graph G is said to be unicyclic if it contains a unique cycle. In this work, some unicyclic graphs, paths and generalized 3 -stars are characterized using graph equations involving line graphs.

Keywords

Line graphs, Graph equations.

References

[1] S Beena, “A Characterization of paths, generalized stars and cycles”, Graph Theory of New York LI, 46 – 49 (2006).
[2] F Harary, “Graph Theory”, Addison Wesley, Inc(1969).