Basierend auf den Arbeiten von W. SO sowie W. KLOTZ und T. SANDER setzen wir das Studium der spektralen Eigenschaften von verallgemeinerten unitären Cayley-Graphen, die ggT-Graphen oder auch ganzzahlige zirkuläre Graphen genannt werden, fort. In diesem Zusammenhang werden wir viele noch offene Fragen beantworten. Das Hauptwerkzeug für unsere Arbeit ist die Feststellung, dass die Eigenwerte eines ggT-Graphen Arithmetische Faltungen vom Narkiewicz-Typ entsprechen. Durch die Benutzung unseres Konzeptes von multiplikativen Teilermengen erhalten wir sowohl einige wichtige spektrale Eigenschaften (z.B. Extremalenergien) von ggT-Graphen als auch weitere interessante Anwendungen, wie beispielsweise Verschwindende Summen von Potenzen von primitiven ...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. W...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study ...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
L’utilisation de l’algèbre pour résoudre des problèmes de graphes a conduit au développement de troi...
The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of th...
International audienceLike Cayley graphs, G-graphs are graphs that are constructed from groups but t...
AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Al...
AbstractA graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. W...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study ...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
L’utilisation de l’algèbre pour résoudre des problèmes de graphes a conduit au développement de troi...
The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of th...
International audienceLike Cayley graphs, G-graphs are graphs that are constructed from groups but t...
AbstractThis work is based on ideas of Ilić [A. Ilić, The energy of unitary Cayley graphs, Linear Al...
AbstractA graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...