The following pages link to Sarah Spence Adams (Q412333):
Displayed 20 items.
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids (Q427907) (← links)
- On island sequences of labelings with a condition at distance two (Q968105) (← links)
- Multilevel and multidimensional Hadamard matrices (Q1009155) (← links)
- On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
- Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
- Labeling matched sums with a condition at distance two (Q2430056) (← links)
- On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs (Q2457022) (← links)
- Quaternion orthogonal designs from complex companion designs (Q2469533) (← links)
- Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products (Q2848721) (← links)
- (Q2869466) (← links)
- (Q2940114) (← links)
- (Q3101021) (← links)
- The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes (Q3549029) (← links)
- (Q3620811) (← links)
- The Theory of Quaternion Orthogonal Designs (Q4567622) (← links)
- An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs (Q4590490) (← links)
- Novel Constructions of Improved Square Complex Orthogonal Designs for Eight Transmit Antennas (Q4974009) (← links)
- The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs (Q4976033) (← links)