Graphs whose minimal rank is two.
Barrett, Wayne, van der Holst, Hein, Loewy, Raphael (2004)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Graphs whose minimal rank is two: the finite fields case.”
Graphs whose minimal rank is two.
The Merris index of a graph.
Goldberg, Felix, Shapiro, Gregory (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Inertia sets for graphs on six or fewer vertices.
Barrett, Wayne, Jepsen, Camille, Lang, Robert, Mchenry, Emily, Nelson, Curtis, Owens, Kayla (2010)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Minimum rank of edge subdivisions of graphs.
Barrett, Wayne, Bowcutt, Ryan, Cutler, Mark, Gibelyou, Seth, Owens, Kayla (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
-colorings and -bipartite graphs.
Hoang, C.T., Le, V.B. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Bipartite toughness and -factors in bipartite graphs.
Liu, Guizhen, Qian, Jianbo, Sun, Jonathan Z., Xu, Rui (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The adjacency graphs of a complex
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Graphs of low chordality.
Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: