On the bipartite distance matrix and the bipartite Laplacian matrix

Simple item page
dc.contributor.authorJana, Rakesh
dc.date.accessioned2023-10-06T11:30:18Z
dc.date.accessioned2023-10-20T12:31:12Z
dc.date.available2023-10-06T11:30:18Z
dc.date.available2023-10-20T12:31:12Z
dc.date.issued2021
dc.descriptionSupervisor: Pati, Sukantaen_US
dc.description.abstractThe study of the properties of graphs via matrices is a widely studied subject that ties together two seemingly unrelated branches of mathematics; graph theory and linear algebra. Graham and Pollak in 1971 proved a remarkable result which tells that the determinant of the distance matrix of a tree only depends on the number of vertices in the tree. This impressive result created a lot of interest among the researchers. Since then many generalizations have been proposed in order to understand the distance matrix better. Yet, the understanding seems to be far from complete. We present one such point of view here showing how many more combinatorial objects are linked together.en_US
dc.identifier.otherROLL NO.156123009
dc.identifier.urihttps://gyan.iitg.ac.in/handle/123456789/2475
dc.language.isoenen_US
dc.relation.ispartofseriesTH-2878;
dc.subjectDistance Matrixen_US
dc.subjectLaplacian Matrixen_US
dc.subjectTreeen_US
dc.subjectBipartite Distance Matrixen_US
dc.subjectBipartite Laplacian Matrixen_US
dc.subjectMatrix Tree Theoremen_US
dc.subjectBipartite Graphen_US
dc.titleOn the bipartite distance matrix and the bipartite Laplacian matrixen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Abstract-TH-2878_156123009.pdf
Size:
88.91 KB
Format:
Adobe Portable Document Format
Description:
ABSTRACT
Download
No Thumbnail Available
Name:
TH-2878_156123009.pdf
Size:
1.3 MB
Format:
Adobe Portable Document Format
Description:
THESIS
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download
Collections
PhD Theses (Mathematics)