Results 11 to 20 of about 2,715 (247)
Infinite generalized friendship graphs
Discrete Mathematics, 1984 Let \(\tau\geq 2\) and \(\lambda\geq 1\) be integers, and let c be an infinite cardinal number. It is shown that \(\tau \leq \lambda +1\) is necessary and sufficient for the existence of (simple) infinite graphs of order c such that every subset of \(\tau\) vertices has exactly \(\lambda\) common neighbors.
Gena Hahn
exaly +3 more sources
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers { 1 , 2 , 3 , … , p + q } such that all the edge-weights w ( u v ) = f ( u ) + f ( v ) + f ( u v ) ; u v ∈ E ( G ...
Subramanian Arumugam
exaly +2 more sources
From graph theory to chemoinformatics: modified bond-based indices and a hypothesis-driven multi-task QSAR/QSPR benchmark [PDF]
Scientific ReportsGraph–theoretic degree–based descriptors play a central role in chemoinformatics and QSPR/QSAR modelling, yet most classical indices either focus purely on vertex degrees or treat bond contributions in a purely multiplicative way.
Azzam Altairi +3 more
doaj +2 more sources
On Strongly Regular Graphs and the Friendship Theorem
MathematicsThis paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of strongly regular graphs, recently derived by
Igal Sason
doaj +3 more sources
The friendship paradox for sparse random graphs
Probability Theory and Related FieldsAbstract Let $$G_n$$ G n be an undirected finite graph on $$n\in {\mathbb {N}}$$ n
Den Hollander Frank
exaly +3 more sources
Trust and class aware service discovery with dual control in the social Internet of Things [PDF]
Scientific ReportsService discovery in the Social Internet of Things (SIoT) must be both efficient and trustworthy. Dense device graphs and heterogeneous link reliability make naïve traversal ineffective and risk-prone.
Abdul Rehman +5 more
doaj +2 more sources
Domination number of middle graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs,
Farshad Kazemnejad +3 more
doaj +1 more source
Group vertex magicness of H-join and generalised friendship graph
Electronic Journal of Graph Theory and ApplicationsIn this paper, we consider A-vertex magic graphs, where A is a non-trivial Abelian group. We characterize Z-vertex magic graphs. We also explore the relation between the A-vertex magicness of a graph G and its reduced graph.
S. Balamoorthy, S.V. Bharanedhar
doaj +4 more sources
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
Journal of Mathematics, 2022 In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid +3 more
doaj +1 more source
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The 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 text] where In ...
Aqib Khan +2 more
doaj +1 more source