Combinatorial labelings of graphs.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2006)
Applied Mathematics E-Notes [electronic only]
Similarity:
Displaying similar documents to “Generalisations of the Tits representation.”
Combinatorial labelings of graphs.
The cube polynomial and its derivatives: The case of median graphs.
Brešar, Boštjan, Klavžar, Sandi, Škrekovski, Riste (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Graph powers and graph homomorphisms.
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The remarkable generalized Petersen graph
Dragan Marušič, Tomaž Pisanski (2000)
Mathematica Slovaca
Similarity:
Universality in Graph Properties with Degree Restrictions
Izak Broere, Johannes Heidema, Peter Mihók (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set [...] of all countable graphs (since every graph in [...] is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of [...] is provided....
The irregularity of graphs under graph operations
Hosam Abdo, Darko Dimitrov (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). In this paper we consider the irregularity of graphs under several graph operations including join, Cartesian product, direct product, strong product, corona product, lexicographic product, disjunction and sym- metric difference. We give exact expressions or (sharp) upper bounds on the irregularity of graphs under the...
Characterizations of the Family of All Generalized Line Graphs-Finite and Infinite-and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...