Graphs with most number of three point induced connected subgraphs

DOI10.1016/0166-218X(93)E0155-RMaRDI QIDQ1804874zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

connected subgraphsreliability

Mathematics Subject Classification ID

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

Review text

It is known that graphs which maximize the residual connectedness reliability (in the node failure model) among all graphs with given numbers of vertices and edges are related to graphs which maximize the number of induced, 3-vertex connected subgraphs. This paper characterizes the latter graphs with not too many edges.

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

Cites work

• scientific article; zbMATH DE number 3745240 (Why is no real title available?)
• scientific article; zbMATH DE number 3458684 (Why is no real title available?)
• scientific article; zbMATH DE number 3482386 (Why is no real title available?)
• scientific article; zbMATH DE number 3547309 (Why is no real title available?)
• scientific article; zbMATH DE number 3225111 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(2)

• scientific article; zbMATH DE number 733800 (Why is no real title available?)
• Residual reliability of P-threshold graphs

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)