438 hasil
Menampilkan 1–20 · 0,15 detik · RSS
AKCE International Journal of Graphs and Combinatorics
Scopus
ISSN 0972-8600 · Taylor & Francis Group · 438 artikel di indeks
-
Artikel Jurnal
On the eigenvalues of zero-divisor graph associated to finite commutative ring
Let Z(R) be the set of zero-divisors of a commutative ring R with non-zero identity and be the set of non-zero zero-divisors of R. The zero-divisor graph of R, denoted by is a simple graph whose vertex set is and two vertices are adjacent if and only if In this paper, we investigate the adjacency…
-
Artikel Jurnal
The spectral determination of the connected multicone graphs
The main goal of the paper is to answer an unsolved problem. A multicone graph is defined to be the join of a clique and a regular graph, and a wheel as the join of a vertex and a cycle. In this study, we present new classes of multicone graphs that are natural generalizations of wheel graphs and…
-
Artikel Jurnal
The cubic power graph of finite abelian groups
Let G be a finite abelian group with identity 0. For an integer the additive power graph of G is the simple undirected graph with vertex set G in which two distinct vertices x and y are adjacent if and only if x + y = nt for some with When the additive power graph has been studied in the name of…
-
Artikel Jurnal
On the total Roman domination stability in graphs
A total Roman dominating function on a graph G is a function satisfying the conditions: (i) every vertex u with f(u) = 0 is adjacent to at least one vertex v of G for which f(v) = 2; (ii) the subgraph induced by the vertices assigned non-zero values has no isolated vertices. The minimum of over all…
-
Artikel Jurnal
Some product graphs with power dominating number at most 2
Let S be a set of vertices of a graph G. Let be the set of vertices built from the closed neighborhood of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in then the remaining neighbor is also in A set S is called a power…
-
Artikel Jurnal
Independent point-set domination in line graphs
Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by establishing a fundamental relation between diameter of…
-
Artikel Jurnal
Recent developments on the power graph of finite groups – a survey
Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools in computer science. Conversely, graph…
-
Artikel Jurnal
Antimagic labeling of new classes of trees
An antimagic labeling of a graph G with q edges is an injective mapping such that the induced vertex label for each vertex is different, where the induced vertex label of a vertex u is Here, E(u) is the set of edges incident to the vertex u. In 1990, Hartsfield and Ringel conjectured that all trees…
-
Artikel Jurnal
Graceful labeling of digraphs—a survey
A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v) − g(u)) (mod q + 1) If the arc values are all distinct then the labeling is called a…
-
Artikel Jurnal
Relationship between radio k-chromatic number of graphs and square graphs
Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed…
-
Artikel Jurnal
On a conjecture concerning total domination subdivision number in graphs
Let be the total domination number and let be the total domination subdivision number of a graph G with no isolated vertex. In this paper, we show that for some classes of graphs G, which partially solve the conjecture presented by Favaron et al.
-
Artikel Jurnal
Prime labeling in the context of web graphs without center
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels. In this paper we investigate prime labeling for web graphs without center and graphs resulting from…
-
Artikel Jurnal
The minimal and maximal energies of all cubic circulant graphs
In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained. In this article, first we compute the upper and lower bounds for the energies of the isomorphic copies of Möbius ladder…
-
Artikel Jurnal
Independent resolving sets in graphs
Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian…
-
Artikel Jurnal
m-Bonacci graceful labeling
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show that complete graphs, complete bipartite graphs…
-
Artikel Jurnal
Metric dimension of ideal-intersection graph of the ring
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n being a positive integer.
-
Artikel Jurnal
Double Roman reinforcement number in graphs
For a graph a double Roman dominating function is a function having the property that if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(v) = 1, then vertex v must have at least one neighbor w with The weight of a double Roman…
-
Artikel Jurnal
A note on subspace sum graph of vector spaces
For a finite dimensional vector space over a field the subspace sum graph of denoted by is defined to be a simple undirected graph with vertex set as the set of all non-trivial proper subspace of and, for any two distinct vertices V1 and V2 are adjacent if and only if In this paper, we establish…
-
Artikel Jurnal
Laplacian spectral determination of path-friendship graphs
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to G. In some recent papers it is proved that the friendship graphs and starlike trees are DLS. If a friendship graph and a starlike tree are joined by merging their…
-
Artikel Jurnal
Local edge coloring of graphs
Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge coloring c to an edge of G is called the value of…