On Some Graph Operations and Related Applications
From MaRDI portal
Publication:2839255
DOI10.1016/j.endm.2009.03.018zbMath1267.05226OpenAlexW2044042211MaRDI QIDQ2839255
V. Yegnanarayanan, T. Padmavathy, P. R. Thiripurasundari
Publication date: 4 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.03.018
Related Items (3)
The number of spanning trees in a new lexicographic product of graphs ⋮ The number of spanning trees in the composition graphs ⋮ The irregularity of graphs under graph operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring a graph in polynomial time
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- The Kronecker Product of Graphs
- A group-theoretic model for symmetric interconnection networks
- On the pseudoachromatic number of join of graphs
- The Categorical Product of Graphs
- On Topological Invariants of the Product of Graphs
This page was built for publication: On Some Graph Operations and Related Applications