EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


26853 Generalization of binomial coefficients to numbers on the nodes of graphs
Home Policy Brochure Browse Search User Area Contact Help

Khmelnitskaya, A.B. and van der Laan, G. and Talman, A.J.J. (2016) Generalization of binomial coefficients to numbers on the nodes of graphs. Memorandum 2054, Department of Applied Mathematics, University of Twente, Enschede. ISSN 1874-4850

Full text available as:

PDF

202 Kb
Open Access



Official URL: http://www.math.utwente.nl/publications/

Exported to Metis

Abstract

The triangular array of binomial coefficients, or Pascal's triangle, is formed by starting with an apex of 1. Every row of Pascal's triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is equal to the number of ways the line-graph can be constructed when starting with this node and adding subsequently neighboring nodes one by one. Using this interpretation we generalize the sequences of binomial coefficients on each row of Pascal's triangle to so-called Pascal graph numbers assigned to the nodes of an arbitrary (connected) graph. We show that on the class of connected cycle-free graphs the Pascal graph numbers have properties that are very similar to the properties of binomial coefficients. We also show that for a given connected cycle-free graph the Pascal graph numbers, when normalized to sum up to one, are equal to the steady state probabilities of some Markov process on the nodes. Properties of the Pascal graph numbers for arbitrary connected graphs are also discussed. Because the Pascal graph number of a node in a connected graph is defined as the number of ways the graph can be constructed by a sequence of increasing connected subgraphs starting from this node, the Pascal graph numbers can be seen as a measure of centrality in the graph.

Item Type:Internal Report (Memorandum)
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:CTIT-General
Uncontrolled Keywords:binomial coefficient, Pascal's triangle, graph, Markov process, centrality measure
ID Code:26853
Deposited On:26 February 2016
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item