Graphs with most number of three point induced connected subgraphs

DOI10.1016/0166-218X(93)E0155-RzbMATH Open0835.05056OpenAlexW2023610558MaRDI QIDQ1804874FDOQ1804874

Authors: Yanyan Li 

Publication date: 17 May 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0155-r

Recommendations

• scientific article; zbMATH DE number 867686
• scientific article; zbMATH DE number 1444280
• scientific article; zbMATH DE number 733800
• Uniformly most reliable three-terminal graph of dense graphs

zbMATH Keywords

reliabilityconnected subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites Work

• Parallel concepts in graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Residual reliability of P-threshold graphs
• Title not available (Why is that?)

This page was built for publication: Graphs with most number of three point induced connected subgraphs

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