Displaying similar documents to “The path space of a higher-rank graph”

Iterated neighborhood graphs

Martin Sonntag, Hanns-Martin Teichert (2012)

Discussiones Mathematicae Graph Theory

Similarity:

The neighborhood graph N(G) of a simple undirected graph G = (V,E) is the graph ( V , E N ) where E N = a,b | a ≠ b, x,a ∈ E and x,b ∈ E for some x ∈ V. It is well-known that the neighborhood graph N(G) is connected if and only if the graph G is connected and non-bipartite. We present some results concerning the k-iterated neighborhood graph N k ( G ) : = N ( N ( . . . N ( G ) ) ) of G. In particular we investigate conditions for G and k such that N k ( G ) becomes a complete graph.

Remarks on partially square graphs, hamiltonicity and circumference

Hamamache Kheddouci (2001)

Discussiones Mathematicae Graph Theory

Similarity:

Given a graph G, its partially square graph G* is a graph obtained by adding an edge (u,v) for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition N G ( x ) N G [ u ] N G [ v ] , where N G [ x ] = N G ( x ) x . In the case where G is a claw-free graph, G* is equal to G². We define σ ° = m i n x S d G ( x ) : S i s a n i n d e p e n d e n t s e t i n G * a n d | S | = t . We give for hamiltonicity and circumference new sufficient conditions depending on σ° and we improve some known results.

Intersection graph of gamma sets in the total graph

T. Tamizh Chelvam, T. Asir (2012)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper, we consider the intersection graph I Γ ( ) of gamma sets in the total graph on ℤₙ. We characterize the values of n for which I Γ ( ) is complete, bipartite, cycle, chordal and planar. Further, we prove that I Γ ( ) is an Eulerian, Hamiltonian and as well as a pancyclic graph. Also we obtain the value of the independent number, the clique number, the chromatic number, the connectivity and some domination parameters of I Γ ( ) .

Potentially H-bigraphic sequences

Michael Ferrara, Michael Jacobson, John Schmitt, Mark Siggers (2009)

Discussiones Mathematicae Graph Theory

Similarity:

We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative integer sequences. The sequence pair S = (A,B) is said to be bigraphic if there is some bipartite graph G = (X ∪ Y,E) such that A and B are the degrees of the vertices in X and Y, respectively. If S is a bigraphic pair, let σ(S) denote the sum of the terms in A. Given a bigraphic pair S, and a fixed bipartite graph H, we say that S is potentially H-bigraphic if there is some realization of...

The spectral determinations of the connected multicone graphs K w m P 17 and K w m S

Ali Zeydi Abdian, S. Morteza Mirafzal (2018)

Czechoslovak Mathematical Journal

Similarity:

Finding and discovering any class of graphs which are determined by their spectra is always an important and interesting problem in the spectral graph theory. The main aim of this study is to characterize two classes of multicone graphs which are determined by both their adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let K w denote a complete graph on w vertices, and let m be a positive integer number. In A. Z. Abdian (2016)...

When a line graph associated to annihilating-ideal graph of a lattice is planar or projective

Atossa Parsapour, Khadijeh Ahmad Javaheri (2018)

Czechoslovak Mathematical Journal

Similarity:

Let ( L , , ) be a finite lattice with a least element 0. 𝔸 G ( L ) is an annihilating-ideal graph of L in which the vertex set is the set of all nontrivial ideals of L , and two distinct vertices I and J are adjacent if and only if I J = 0 . We completely characterize all finite lattices L whose line graph associated to an annihilating-ideal graph, denoted by 𝔏 ( 𝔸 G ( L ) ) , is a planar or projective graph.

Nonempty intersection of longest paths in a graph with a small matching number

Fuyuan Chen (2015)

Czechoslovak Mathematical Journal

Similarity:

A maximum matching of a graph G is a matching of G with the largest number of edges. The matching number of a graph G , denoted by α ' ( G ) , is the number of edges in a maximum matching of G . In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture...

The induced paths in a connected graph and a ternary relation determined by them

Ladislav Nebeský (2002)

Mathematica Bohemica

Similarity:

By a ternary structure we mean an ordered pair ( X 0 , T 0 ) , where X 0 is a finite nonempty set and T 0 is a ternary relation on X 0 . By the underlying graph of a ternary structure ( X 0 , T 0 ) we mean the (undirected) graph G with the properties that X 0 is its vertex set and distinct vertices u and v of G are adjacent if and only if { x X 0 T 0 ( u , x , v ) } { x X 0 T 0 ( v , x , u ) } = { u , v } . A ternary structure ( X 0 , T 0 ) is said to be the B-structure of a connected graph G if X 0 is the vertex set of G and the following statement holds for all u , x , y X 0 : T 0 ( x , u , y ) if and only if u belongs to an...

The Wiener number of powers of the Mycielskian

Rangaswami Balakrishnan, S. Francis Raj (2010)

Discussiones Mathematicae Graph Theory

Similarity:

The Wiener number of a graph G is defined as 1 / 2 u , v V ( G ) d ( u , v ) , d the distance function on G. The Wiener number has important applications in chemistry. We determine a formula for the Wiener number of an important graph family, namely, the Mycielskians μ(G) of graphs G. Using this, we show that for k ≥ 1, W ( μ ( S k ) ) W ( μ ( T k ) ) W ( μ ( P k ) ) , where Sₙ, Tₙ and Pₙ denote a star, a general tree and a path on n vertices respectively. We also obtain Nordhaus-Gaddum type inequality for the Wiener number of μ ( G k ) .

On 𝓕-independence in graphs

Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Let be a set of graphs and for a graph G let α ( G ) and α * ( G ) denote the maximum order of an induced subgraph of G which does not contain a graph in as a subgraph and which does not contain a graph in as an induced subgraph, respectively. Lower bounds on α ( G ) and α * ( G ) are presented.

A note on periodicity of the 2-distance operator

Bohdan Zelinka (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The paper solves one problem by E. Prisner concerning the 2-distance operator T₂. This is an operator on the class C f of all finite undirected graphs. If G is a graph from C f , then T₂(G) is the graph with the same vertex set as G in which two vertices are adjacent if and only if their distance in G is 2. E. Prisner asks whether the periodicity ≥ 3 is possible for T₂. In this paper an affirmative answer is given. A result concerning the periodicity 2 is added.

Special m-hyperidentities in biregular leftmost graph varieties of type (2,0)

Apinant Anantpinitwatna, Tiang Poomsa-ard (2009)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies a term equation s ≈ t if the corresponding graph algebra A ( G ) ̲ satisfies s ≈ t. A class of graph algebras V is called a graph variety if V = M o d g Σ where Σ is a subset of T(X) × T(X). A graph variety V ' = M o d g Σ ' is called a biregular leftmost graph variety if Σ’ is a set of biregular leftmost term equations. A term equation s ≈ t is called an identity...