Abstract

In contemporary mathematics, the simplicial complexes are studied in graph theory by considering them as higher dimensional graphs. The main aim of this article is to apply the notion of incidence matrices of oriented simplicial complexes to compute combinatorial laplacian of simplicial complexes directly. Mathematics Subject Classification: 05B20, 05C50, 05E45, 35J05

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.