On Color Polynomials of Fibonacci Graphs.

Abstract

A recursion exists among the coefficients of the color polynomials of some of the families of graphs considered in recent work of Balasubramanian and Ramaraj. Such families of graphs have been called Fibonacci graphs. Application to king patterns of lattices is given. The method described here applies only to the so called Fibonacci graphs. Keywords: Graph theory; King Polynomials Graphs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 11, 1987
Accession Number
ADA184133

Entities

People

  • Sherif El-basil

Organizations

  • University of Georgia

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • California
  • Chemistry
  • Civil Engineering
  • Coefficients
  • Computational Chemistry
  • Engineering
  • Graph Theory
  • Marine Corps
  • Mathematics
  • Military Research
  • Polynomials
  • Statistical Mechanics
  • Technical Information Centers
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.