Showing 1 - 8 results of 8 for search 'Lapus, Raymond R.' Skip to content
VuFind
  • Feedback
  • Your Account
  • Log Out
  • Login
  • Theme
    • Bootstrap
    • Aunilo
  • Language
    • English
    • 中文(繁體)
    • اللغة العربية
Advanced
  • Author
  • Lapus, Raymond R.
Showing 1 - 8 results of 8 for search 'Lapus, Raymond R.', query time: 0.01s Refine Results
1
The D-weight of a graph
The D-weight of a graph
by Lapus, Raymond R.
Published 2007
Get full text
text
Save to List
Saved in:
2
The aggregate of a graph
The aggregate of a graph
by Lapus, Raymond R.
Published 2007
Get full text
text
Save to List
Saved in:
3
Constructing an automaton graph representation for stack polygons and bar-graph polygons
Constructing an automaton graph representation for stack polygons and bar-graph polygons
by Lapus, Raymond R.
Published 2009
Get full text
text
Save to List
Saved in:
4
On the st-spreading resistance of networks
On the st-spreading resistance of networks
by Lapus, Raymond R.
Published 2010
Get full text
text
Save to List
Saved in:
5
On the st-spread resistance of a graph
On the st-spread resistance of a graph
by Lapus, Raymond R.
Published 2010
Get full text
text
Save to List
Saved in:
6
On the lower bound for the spread process in a graph
On the lower bound for the spread process in a graph
by Lapus, Raymond R.
Published 2010
Get full text
text
Save to List
Saved in:
7
The K-spread resistance of graph
The K-spread resistance of graph
by Lapus, Raymond R.
Published 2010
Get full text
text
Save to List
Saved in:
8
Enumerating the number of admissible stack polygons: An approach using finite automaton
Enumerating the number of admissible stack polygons: An approach using finite automaton
by Lapus, Raymond R.
Published 2009
Get full text
text
Save to List
Saved in:
Search Tools: Get RSS Feed — Email this Search —

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs
Loading...