Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers

DOI10.1016/S1571-0653(04)00570-0MaRDI QIDQ3439077zbMATH OpenOpenAlexFDO

Authors E. Sampathkumar, B. D. Acharya, S. B. Rao, S. A. Choudum

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00570-0

zbMATH Keywords

graphsk-completion numberk-degrees

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
• On k-independence critical graphs
• The \(k\)-independent graph of a graph
• scientific article; zbMATH DE number 31760
• scientific article; zbMATH DE number 4103104

Cited in

(2)

• Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
• Generalization of bipartite graphs

This page was built for publication: Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers

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