scientific article; zbMATH DE number 866671

zbMATH Open0840.05037MaRDI QIDQ4873690FDOQ4873690

Authors: K. Jay Bagga, R. L. Sedlmeyer, Marc J. Lipman, L. W. Beineke, Raymond E. Pippert 

Publication date: 17 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4112609
• An algorithm for the computation of edge integrity, \(I^\prime(T)\)
• The edge-integrity of some graphs
• scientific article; zbMATH DE number 867677
• scientific article; zbMATH DE number 4085694

zbMATH Keywords

treesalgorithmedge-integrity

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited In (14)

• Edge integrity of nearest neighbor graphs and separator theorems
• Bounds of the sum of edge lengths in linear arrangements of trees
• Bounds on the number of edges in hypertrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Slavery accessibility integrity number of graphs
• Title not available (Why is that?)
• The common-neighbourhood of a graph
• A survey of integrity
• Title not available (Why is that?)
• On the edge-integrity of some graphs and their complements
• An algorithm for the computation of edge integrity, \(I^\prime(T)\)
• Edge-integrity: A survey
• The edge-integrity of some graphs

This page was built for publication:

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