Max-plus objects to study the complexity of graphs

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 7 figures. 2 figures were not displayed properly in the first version

Scientific paper

Given an undirected graph $G$, we define a new object $H_G$, called the mp-chart of $G$, in the max-plus algebra. We use it, together with the max-plus permanent, to describe the complexity of graphs. We show how to compute the mean and the variance of $H_G$ in terms of the adjacency matrix of $G$ and we give a central limit theorem for $H_G$. Finally, we show that the mp-chart is easily tractable also for the complement graph.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Max-plus objects to study the complexity of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Max-plus objects to study the complexity of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Max-plus objects to study the complexity of graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-704119

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.