Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Characteristic Parameters, Chordal Graphs, and Common Neighborhoods

Terry A. McKee1
1 Department of Mathematics & Statistics Wright State University, Dayton, Ohio 45435
  • Published: 30/06/1997

Abstract

The “characteristic” of a graph—the number of vertices, minus the number of edges, plus the number of triangles, etc.—is a little-studied, overtly combinatorial graph parameter intrinsically related to chordal graphs and common neighborhoods of subgraphs. I also introduce a sequence of related “higher characteristic” parameters.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Terry A. McKee. Characteristic Parameters, Chordal Graphs, and Common Neighborhoods[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 024. 156-159. DOI: .