- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources2
- Resource Type
-
0000000002000000
- More
- Availability
-
20
- Author / Contributor
- Filter by Author / Creator
-
-
Gya, Parikshita (2)
-
Ahirwar, Shreya (1)
-
Brooks-Randall, Sophia (1)
-
Cai, Gianna (1)
-
Fishel, Susanna (1)
-
Glass-Klaiber, Juniper (1)
-
Gomez, Maria_A (1)
-
Harris, Pamela (1)
-
Jiang, Yuxin (1)
-
Jo, Sungeun (1)
-
Khan, Samira (1)
-
Lin, Shiyun (1)
-
Lin, Ziqing (1)
-
Marcellus, Marsophia (1)
-
Nguyen, Hong_Anh (1)
-
Pham, Nguyen (1)
-
Pham, Trang (1)
-
Vindas Meléndez, Andrés (1)
-
Vo, Dan Khanh (1)
-
Wang, Yujing (1)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Let $$G$$ be a graph with vertex set $$\{1,2,\ldots,n\}$$. Its bond lattice, $BL(G)$, is a sublattice of the set partition lattice. The elements of $BL(G)$ are the set partitions whose blocks induce connected subgraphs of $$G$$. In this article, we consider graphs $$G$$ whose bond lattice consists only of noncrossing partitions. We define a family of graphs, called triangulation graphs, with this property and show that any two produce isomorphic bond lattices. We then look at the enumeration of the maximal chains in the bond lattices of triangulation graphs. Stanley's map from maximal chains in the noncrossing partition lattice to parking functions was our motivation. We find the restriction of his map to the bond lattice of certain subgraphs of triangulation graphs. Finally, we show the number of maximal chains in the bond lattice of a triangulation graph is the number of ordered cycle decompositions.more » « less
-
Gomez, Maria_A; Brooks-Randall, Sophia; Cai, Gianna; Glass-Klaiber, Juniper; Jiang, Yuxin; Jo, Sungeun; Lin, Ziqing; Lin, Shiyun; Marcellus, Marsophia; Nguyen, Hong_Anh; et al (, The Journal of Chemical Physics)