Zobrazeno 1 - 10
of 1 284
pro vyhledávání: '"wheel graph"'
Publikováno v:
Transactions on Combinatorics, Vol 12, Iss 4, Pp 207-216 (2023)
In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Externí odkaz:
https://doaj.org/article/406a1e13fa6a44649fc5bd1f795932bb
Autor:
Mohammed Aljohani, Salama Nagy Daoud
Publikováno v:
Mathematics, Vol 12, Iss 8, p 1203 (2024)
A graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from
Externí odkaz:
https://doaj.org/article/915353d3edc4456fa25397f93e8f4377
Autor:
Herish Abdullah, Ivan Ali
Publikováno v:
Al-Rafidain Journal of Computer Sciences and Mathematics, Vol 17, Iss 1, Pp 99-106 (2023)
Restricted detour distance between two vertices and of a graph is the length of a longest u- v path for the induced condition (V (P))=P. The restricted detour polynomial depends on restricted detour distance and is denoted by D*(G,x) and defined
Externí odkaz:
https://doaj.org/article/496932c63e824d078857dd51b1c3569c
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 79-90 (2023)
AbstractThe permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see te
Externí odkaz:
https://doaj.org/article/7c2fedeb64d241f2b54d6b085c39569f
Autor:
M Sree Vidya, S.S Sandhya
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 281-287 (2022)
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined by and all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling. A gr
Externí odkaz:
https://doaj.org/article/6323342878734c4ea3671d1fa12eecc3
Autor:
Devsi Bantva
Publikováno v:
Discrete Mathematics Letters, Vol 10, Pp 91-98 (2022)
Externí odkaz:
https://doaj.org/article/abb49dcfcf124030848570c4a322c2d4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
G. R Sanma, P Maya
Publikováno v:
Ratio Mathematica, Vol 45, Iss 0 (2023)
For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k). The colori
Externí odkaz:
https://doaj.org/article/41426165064d49fdb477f3ed4ec55cc9
Publikováno v:
Symmetry, Vol 15, Iss 9, p 1737 (2023)
Consider G to be a simple graph with n vertices and m edges, and L(G) to be a Laplacian matrix with Laplacian eigenvalues of μ1,μ2,…,μn=zero. Write Sk(G)=∑i=1kμi as the sum of the k-largest Laplacian eigenvalues of G, where k∈{1,2,…,n}. T
Externí odkaz:
https://doaj.org/article/b9af62fee5aa46c4bdd7bfdf6a4a929e