Graph Transformations,Interpolation And Extremal Theorems For Graph Parameters
Narong Punnim
Abstract
Narong Punnim
Abstract
Let be the class of all graphs and A graph parameter is called an interpolation graph parameter over if there exist integers a and b such that Thus if is an interpolation graph parameter over then is uniquely determined by The problem of finding is called the extremal problem in graph theory. We will discuss our results which have been done, in this direction, in the past ten years. Some open problems are also reviewed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let be the class of all graphs and A graph parameter is called an interpolation graph parameter over if there exist integers a and b such that Thus if is an interpolation graph parameter over then is uniquely determined by The problem of finding is called the extremal problem in graph theory. We will discuss our results which have been done, in this direction, in the past ten years. Some open problems are also reviewed.
Key concepts: Mathematics, Extremal graph theory, Combinatorics, Graph, Null graph, Discrete mathematics, Strength of a graph, Voltage graph