scientific article; zbMATH DE number 866671

MaRDI QIDQ4873690zbMATH OpenFDO

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

Publication date 17 April 1996

zbMATH Keywords

algorithmedge-integritytrees

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(15)

• A survey of integrity
• Edge-integrity: A survey
• On the edge-integrity of some graphs and their complements
• Edge integrity of nearest neighbor graphs and separator theorems
• The edge-integrity of some graphs
• Bounds on the number of edges in hypertrees
• An algorithm for the computation of edge integrity, I^(T)
• scientific article; zbMATH DE number 4043858 (Why is no real title available?)
• scientific article; zbMATH DE number 4112609 (Why is no real title available?)
• scientific article; zbMATH DE number 731853 (Why is no real title available?)
• The common-neighbourhood of a graph
• scientific article; zbMATH DE number 2094428 (Why is no real title available?)
• scientific article; zbMATH DE number 867677 (Why is no real title available?)
• Bounds of the sum of edge lengths in linear arrangements of trees
• Slavery accessibility integrity number of 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)