Abstract
A simplicial scheme is a certain structure which can be defined on graphs. The purpose of this concept is a graph-theoretical description of simplicial complexes. It is shown that graphs and simplicial schemes give rise precisely to simplicial pseudocomplexes which are pure and in which the open star of every simplex is strongly connected and every simplex of codimension one is contained in at most two top-dimensional simplices. A characterization is given for a complex arising from a graph and a simplicial scheme to be orientable. Finally, a relation between graph maps and nondegenerate simplicial maps of associated complexes is considered.
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 callDisclaimer: 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.
