Characterization of pathos adjacency blict graph of a tree

MaRDI QIDQ5173437zbMATH OpenFDO

Authors Hadonahalli Mudalagiraiah Nagesh, R. Chandrasekhar

Publication date 16 February 2015

zbMATH Keywords

crossing number \(\mathrm{cr}(G)\)inner vertex number \(i(G)\)minimally non-outerplanarouterplanarSmarandachely blict graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 7013302
• On pathos block line cut-vertex graph of a tree
• On pathos qlick graph of a tree
• On pathos line graph of a tree
• On pathos semitotal and total block graph of a tree

Cited in

(5)

• On pathos qlick graph of a tree
• The blict graph and blitact graph of a graph
• On pathos adjacency cut vertex jump graph of a tree
• On pathos lict subdivision of a tree
• On pathos block line cut-vertex graph of a tree

This page was built for publication: Characterization of pathos adjacency blict graph of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173437)