Search Results - "Carballosa, Walter"
-
1
Education-oriented Proof Assistant Based on Calculational Logic: Proof Theory Algorithms and Assessment Experience
Published in CLEI electronic journal (01-09-2023)“…This work presents an interactive proof assistant, based on Dijkstra-Scholten logic, aimed at teaching logic and discrete mathematics in higher education. The…”
Get full text
Journal Article -
2
Exponential topological indices: optimal inequalities and applications
Published in Journal of mathematical chemistry (01-05-2023)“…In this work we obtain inequalities relating a general topological index of a graph, F ( G ) = ∑ u v ∈ E ( G ) f ( d u , d v ) , with its corresponding…”
Get full text
Journal Article -
3
Computational properties of the arithmetic–geometric index
Published in Journal of mathematical chemistry (2022)“…The concept of arithmetic–geometric index was introduced in the chemical graph theory recently, but it has shown to be useful. We obtain in this paper new…”
Get full text
Journal Article -
4
Relations between the general sum connectivity index and the line graph
Published in Journal of mathematical chemistry (01-11-2020)“…The concept of general sum connectivity index was introduced in the area of chemical graph theory recently. Several of its particular cases have proven to…”
Get full text
Journal Article -
5
Relations between some topological indices and the line graph
Published in Journal of mathematical chemistry (01-03-2020)“…The concepts of geometric–arithmetic and harmonic indices were introduced in the area of chemical graph theory recently. They have proven to correlate well…”
Get full text
Journal Article -
6
Regularity and Planarity of Token Graphs
Published in Discussiones Mathematicae. Graph Theory (01-08-2017)“…Let = ( , ) be a graph of order and let 1 ≤ be an integer. The of is the graph whose vertices are all the -subsets of , two of which are adjacent whenever…”
Get full text
Journal Article -
7
On the hyperbolicity of Delaunay triangulations
Published in AIMS mathematics (01-01-2023)“…If $ X $ is a geodesic metric space and $ x_1, x_2, x_3\in X $, a geodesic triangle $ T = \{x_1, x_2, x_3\} $ is the union of the three geodesics $ [x_1 x_2]…”
Get full text
Journal Article -
8
f-Polynomial on Some Graph Operations
Published in Mathematics (Basel) (01-11-2019)“…Given any function f : Z + → R + , let us define the f-index I f ( G ) = ∑ u ∈ V ( G ) f ( d u ) and the f-polynomial P f ( G , x ) = ∑ u ∈ V ( G ) x 1 / f ( d…”
Get full text
Journal Article -
9
Hyperbolicity of Direct Products of Graphs
Published in Symmetry (Basel) (01-07-2018)“…It is well-known that the different products of graphs are some of the more symmetric classes of graphs. Since we are interested in hyperbolicity, it is…”
Get full text
Journal Article -
10
Total k-domination in Cartesian product of complete graphs
Published in Discrete Applied Mathematics (15-10-2023)“…Let G=(V,E) be a finite undirected graph. A set S of vertices in V is said to be total k-dominating if every vertex in V is adjacent to at least k vertices in…”
Get full text
Journal Article -
11
Alliance polynomial of regular graphs
Published in Discrete Applied Mathematics (10-07-2017)“…The alliance polynomial of a graph G with order n and maximum degree Δ is the polynomial A(G;x)=∑k=−ΔΔAk(G)xn+k, where Ak(G) is the number of exact defensive…”
Get full text
Journal Article -
12
Gromov hyperbolicity in lexicographic product graphs
Published in Proceedings of the Indian Academy of Sciences. Mathematical sciences (01-02-2019)“…If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = { x 1 , x 2 , x 3 } is the union of the three geodesics [ x 1 x 2 ] , [ x 2 x…”
Get full text
Journal Article -
13
Proof Assistant Based on Calculational Logic to Assist the Learning of Propositional Logic and Boolean Algebras
Published in 2022 XVLIII Latin American Computer Conference (CLEI) (17-10-2022)“…Through a friendly user interface it is possible to bring students closer to the proof assistants, so that they can use this type of software as educational…”
Get full text
Conference Proceeding -
14
On the Differential Polynomial of a Graph
Published in Acta mathematica Sinica. English series (01-03-2019)“…We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B ( G ; x ) := ∑ k = − n ∂ ( G ) B k…”
Get full text
Journal Article -
15
Cohen-Macaulayness of triangular graphs
Published in Bulletin mathématiques de la Société des sciences mathématiques de Roumanie (01-01-2017)“…We study the Cohen-Macaulay property of triangular graphs Tn. We show that T2, T3 and T5 are Cohen-Macaulay graphs, and that T4, T6, T8 and Tn are not…”
Get full text
Journal Article -
16
Hyperbolicity in the corona and join of graphs
Published in Aequationes mathematicae (01-10-2015)“…If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = { x 1 , x 2 , x 3 } is the union of the three geodesics [ x 1 x 2 ], [ x 2 x…”
Get full text
Journal Article -
17
On the Hyperbolicity of Edge-Chordal and Path-Chordal Graphs
Published in Filomat (01-01-2016)“…If X is a geodesic metric space and 𝑥₁, 𝑥₂, 𝑥₃ ∈ 𝑋, ageodesic triangle𝑇 = {𝑥₁, 𝑥₂, 𝑥₃} is the union of the three geodesics [𝑥₁𝑥₂], [𝑥₂𝑥₃] and…”
Get full text
Journal Article -
18
Distortion of the hyperbolicity constant in minor graphs
Published in Electronic notes in discrete mathematics (01-09-2014)“…The main aim in this work is to obtain quantitative information about the distortion of the hyperbolicity constant of the graph G\e (respectively, G/e)…”
Get full text
Journal Article -
19
Characterization of the hyperbolicity in the lexicographic product
Published in Electronic notes in discrete mathematics (01-09-2014)“…If X is a geodesic metric space and x1,x2,x3∈X, a geodesic triangleT={x1,x2,x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X…”
Get full text
Journal Article -
20
On the Hyperbolicity Constant in Graph Minors
Published in Bulletin of the Iranian Mathematical Society (01-04-2018)“…A graph H is a minor of a graph G if a graph isomorphic to H can be obtained from G by contracting some edges, deleting some edges, and deleting some isolated…”
Get full text
Journal Article