A technique for reconstructing disconnected graphs
A theorem for an axiomatic approach to metric properties of graphs
A theorem on Hamiltonian line graphs
A viewpoint to the minimum coloring problem of hypergraphs
A visibility representation for graphs in three dimensions.
AB percolation: a brief survey
Adaptive identification in Torii in the King lattice.
Adjacency matrix equations and related problems: Research notes
Adomatic and idomatic numbers of graphs
Algebraic connectivity of graphs
Algebraic properties of edge ideals via combinatorial topology.
Algebraic properties of Husimi trees
Algorithm 36. Transitive closure of a graph
Algunos grafos compuestos.
From two graphs G1 and G2 on N1 and N2 vertices respectively, the compound graph G1[G2] on N1N2 vertices is obtained by connecting in some way N2 copies of G1.We present in this paper methods of compounding that result in families of graphs with large number of vertices for given values of the maximum degree ∆ and diameter D.
Alternating cycles and realizations of a degree sequence
An algorithm for optimal partitioning of a graph
An introduction to -graphs, a graph-theoretic representation of natural numbers.
An ordering of some metrics defined on the space of graphs
An upper bound for the minimum degree of a graph
An upper bound on the basis number of the powers of the complete graphs
The basis number of a graph is defined by Schmeichel to be the least integer such that has an -fold basis for its cycle space. MacLane showed that a graph is planar if and only if its basis number is . Schmeichel proved that the basis number of the complete graph is at most . We generalize the result of Schmeichel by showing that the basis number of the -th power of is at most .