Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs

DOI10.1007/s11786-015-0220-6zbMath1317.05173OpenAlexW1919761093MaRDI QIDQ2516498

V. Annamma, Indra Rajasingh

Publication date: 3 August 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-015-0220-6

zbMATH Keywords

chordal graphgraph labeling1-fault tolerant Hamiltonian graphstotal vertex irregularity strength (tvs)weight of a vertex

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal 1-Hamiltonian graphs
• On irregular total labellings
• Irregularity strength of regular graphs
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• A Tight Bound on the Irregularity Strength of Graphs
• Edge fault tolerance in graphs

This page was built for publication: Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs