Výsledky vyhledávání - "Ayse Dilek Maden"

Metric Properties of Non-Commuting Graph Associated to Two Groups

Autor: Salman Mukhtar, Muhammad Salman, Ayse Dilek Maden, Masood Ur Rehman

Publikováno v: International Journal of Foundations of Computer Science. 33:931-952

The non-commuting graph associated to a group has non-central elements of the graph as vertices and two elements [Formula: see text] and [Formula: see text] do not form an edge if and only if [Formula: see text]. In this paper, we consider non-commut

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::59a717cf88e26c8bfe467bba3d34d067
https://doi.org/10.1142/s0129054122420229

Zobrazit plný text záznamu

Mostar index of graphs associated to groups

Autor: Masood Ur Rehman, Muhammad Salman, Sheraz Khan, Ayse Dilek Maden, Faisal Ali

Publikováno v: Main Group Metal Chemistry. 45:124-135

A bond-additive connectivity index, named as the Mostar index, is used to measure the amount of peripheral edges of a simple connected graph, where a peripheral edge in a graph is an edge whose one end vertex has more number of vertices closer as com

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ad3fbcb59ee1aac7bdd5391222f22613
https://doi.org/10.1515/mgmc-2022-0015

Zobrazit plný text záznamu

New distance-based graph invariants and relations among them

Autor: Ayse Dilek Maden, Ahmet Sinan Çevik

Publikováno v: Applied Mathematics and Computation. 219:11171-11177

The eccentricity of a vertex is the maximum distance from it to another vertex, and the average eccentricity of a graph is the mean eccentricity of a vertex. In this paper we introduce average edge and average vertex-edge mean eccentricities of a gra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::04f50fc1ef6621c03aa347de88e9392e
https://doi.org/10.1016/j.amc.2013.05.024

Zobrazit plný text záznamu

On A Novel Eccentricity-Based Invariant Of A Graph

Autor: Kexiang Xu, Ayse Dilek Maden, Kinkar Ch. Das

In this paper, for the purpose of measuring the non-self-centrality extent of non-selfcentered graphs, a novel eccentricity-based invariant, named as non-self-centrality number (NSC number for short), of a graph G is defined as follows: \(N\left( G \

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::615320903eeb73b6ca0680a82f1b7509
https://aperta.ulakbim.gov.tr/record/60643

Zobrazit plný text záznamu

On the spectral radius of bipartite graphs which are nearly complete

Autor: Kinkar Chandra Das, Ayse Dilek Maden, Ismail Naci Cangul, Ahmet Sinan Çevik

WOS: 000317992400001
For p, q, r, s, t is an element of Z(+) with rt
BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of KoreaMinistry of Education & Human Resources Development (MOEHRD), Republic of Korea; Research Proj

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a87bdf80b169bc7385971673aa9da176
http://hdl.handle.net/11452/32879

Zobrazit plný text záznamu

Retracted Article: On the Kirchhoff matrix, a new Kirchhoff index and the Kirchhoff energy

Autor: Kinkar Chandra Das, Ahmet Sinan Çevik, Ayse Dilek Maden, Ismail Naci Cangul

Publikováno v: Journal of Inequalities and Applications. 2013

Abstract The main purpose of this paper is to define and investigate the Kirchhoff matrix, a new Kirchhoff index, the Kirchhoff energy and the Kirchhoff Estrada index of a graph. In addition, we establish upper and lower bounds for these new indexes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::84b61028bb9d9d11ef97d1cceb57ceb5
https://doi.org/10.1186/1029-242x-2013-337

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání