Ioan Tomescu

95 papers Misc 3Journal 90Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Maximum bond incident degree indices for trees and unicyclic graphs with given maximum degree.
Discret. Appl. Math.
Ioan Tomescu
2023 J jnl
Extremal quasi-unicyclic graphs with respect to vertex-degree function index.
Electron. J. Graph Theory Appl.
Ioan Tomescu
2022 J jnl
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number.
Discret. Appl. Math.
Ioan Tomescu
2022 J jnl
Minimizing vertex-degree function index for k-generalized quasi-unicyclic graphs.
Art Discret. Appl. Math.
Ioan Tomescu
2021 J jnl
Unified extremal results for k-apex unicyclic graphs (trees).
Discret. Appl. Math.
Muhuo Liu, Ioan Tomescu, Jianping Liu
2020 J jnl
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices.
Discret. Appl. Math.
Muhuo Liu, Kun Cheng, Ioan Tomescu
2019 Misc conf
Bicyclic Connected Graphs Having Smallest Degree Distances.
SYNASC
Mihaita Dragan, Ioan Tomescu
2019 J jnl
Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices.
Discret. Appl. Math.
Faisal Javaid, Muhammad Kamran Jamil, Ioan Tomescu
2019 J jnl
Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number.
Art Discret. Appl. Math.
Ioan Tomescu
2019 J jnl
Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2.
Discret. Appl. Math.
Ioan Tomescu
2018 J jnl
First Reformulated Zagreb Index And Some Graph Operations.
Ars Comb.
Muhammad Kamran Jamil, Ioan Tomescu
2017 J jnl
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number.
Discret. Appl. Math.
Muhammad Kamran Jamil, Ioan Tomescu
2016 J jnl
On metric dimension of convex polytopes with pendant edges.
Ars Comb.
Muhammad Imran, Syed Ahtsham Ul Haq Bokhary, Abdul Qudair Baig, Ioan Tomescu
2016 J jnl
On the general sum-connectivity index of connected graphs with given order and girth.
Electron. J. Graph Theory Appl.
Ioan Tomescu
2015 J jnl
Extremal Bicyclic 3-Chromatic Graphs.
Graphs Comb.
Ioan Tomescu, Sana Javed
2015 Misc conf
General Sum-Connectivity Index with α ≥ 1 for Trees and Unicyclic Graphs with k Pendants.
SYNASC
Rozica-Maria Tache, Ioan Tomescu
2015 J jnl
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices.
Discret. Appl. Math.
Ioan Tomescu, Misbah Arshad
2014 J jnl
2-Connected graphs with minimum general sum-connectivity index.
Discret. Appl. Math.
Ioan Tomescu
2014 J jnl
Hypergraphs with pendant paths are not chromatically unique.
Discuss. Math. Graph Theory
Ioan Tomescu
2014 J jnl
On Metric Dimension of Generalized Petersen Graphs P(n, 3).
Ars Comb.
Muhammad Imran, Abdul Qudair Baig, Muhammad Kashif Shafiq, Ioan Tomescu
2014 J jnl
Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index.
Discret. Appl. Math.
Ioan Tomescu, Salma Kanwal
2013 J jnl
On the Chromaticity of Quasi Linear Hypergraphs.
Graphs Comb.
Ioan Tomescu, Sana Javed
2012 J jnl
Multi-level distance labelings for helm graphs.
Ars Comb.
M. Tariq Rahim, Ioan Tomescu
2012 J jnl
On The Cyclomatic Number Of Linear Hypergraphs.
Ars Comb.
Ioan Tomescu, Akhlaq Ahmad Bhatti
2012 — conf
On the Connected Partition Dimension of a Wheel Related Graph.
Computation, Physics and Beyond
Ioan Tomescu
2012 J jnl
Some Results on Chromaticity of Quasi-Linear Paths and Cycles.
Electron. J. Comb.
Ioan Tomescu
2011 J jnl
Magic graphs with pendant edges.
Ars Comb.
Ngurah Anak Agung Gede, Edy Tri Baskoro, Ioan Tomescu
2011 J jnl
Metric Dimension and
Graphs Comb.
Ioan Tomescu, Muhammad Imran
2010 J jnl
Ordering connected graphs having small degree distances.
Discret. Appl. Math.
Ioan Tomescu
2010 J jnl
Series-parallel chromatic hypergraphs.
Discret. Appl. Math.
Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary
2009 J jnl
From rankings' collinearity to counting SDR's via chromatic list expression.
Int. J. Comput. Math.
Liviu Petrisor Dinu, Ioan Tomescu
2009 J jnl
On the Chromaticity of Multi-Bridge Hypergraphs.
Graphs Comb.
Syed Ahtsham Ul Haq Bokhary, Ioan Tomescu, Akhlaq Ahmad Bhatti
2009 J jnl
Properties of connected graphs having minimum degree distance.
Discret. Math.
Ioan Tomescu
2009 J jnl
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs.
Graphs Comb.
Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary
2008 J jnl
Discrepancies between metric dimension and partition dimension of a connected graph.
Discret. Math.
Ioan Tomescu
2008 J jnl
The Ramsey Numbers of Large cycles Versus Odd Wheels.
Graphs Comb.
Surahmat, Edy Tri Baskoro, Ioan Tomescu
2008 J jnl
Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet.
J. Autom. Lang. Comb.
Ioan Tomescu
2007 J jnl
On the chromaticity of sunflower hypergraphs SH(n, p, h).
Discret. Math.
Ioan Tomescu
2007 J jnl
On the number of words containing the factor (aba)
Discret. Appl. Math.
Ioan Tomescu
2007 J jnl
On the partition dimension and connected partition dimension of wheels.
Ars Comb.
Ioan Tomescu, Imran Javaid, Slamin
2006 J jnl
A characterization of the words occurring as factors in a minimum number of words.
Theor. Comput. Sci.
Ioan Tomescu
2006 J jnl
The Ramsey numbers of large cycles versus wheels.
Discret. Math.
Surahmat, Edy Tri Baskoro, Ioan Tomescu
2005 J jnl
Almost all graphs and h-hypergraphs have small diameter.
Australas. J Comb.
Ioan Tomescu
2005 J jnl
Asymptotic Properties of the Factors of Words Over a Finite Alphabet.
Fundam. Informaticae
Ioan Tomescu
2004 J jnl
Sunflower hypergraphs are chromatically unique.
Discret. Math.
Ioan Tomescu
2003 J jnl
Maximal σ-polynomials of connected 3-chromatic graphs.
J. Graph Theory
Ioan Tomescu
2003 J jnl
On the number of occurrences of all short factors in almost all words.
Theor. Comput. Sci.
Ioan Tomescu
2002 J jnl
Irreducible Coverings by Cliques and Sperner's Theorem.
Electron. J. Comb.
Ioan Tomescu
2002 Misc conf
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.
COCOON
Ioan Tomescu
2002 J jnl
On the number of h-connected graphs with a fixed diameter.
Discret. Math.
Ioan Tomescu
2001 J jnl
On the number of graphs and h-hypergraphs with bounded diameter.
Discret. Math.
Ioan Tomescu
2001 — conf
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity.
DMTCS
Ioan Tomescu
2001 J jnl
The number of h-strongly connected digraphs with small diameter.
Australas. J Comb.
Ioan Tomescu
2000 J jnl
Complex Roots of a Polynomial: 10688.
Am. Math. Mon.
Ioan Tomescu, Kee-Wai Lau, O. P. Lossers, Kenneth F. Andersen, Robin J. Chapman, Óscar Ciaurri, E. Fernandez, Valerio De Angelis, Emeric Deutsch, G. Will, M. Falkowitz, Zachary Franco, C. Georghiou, J. Lewandowski, Albert Nijenhuis, Timothy S. Norfolk, Allen Stenger
2000 J jnl
On the number of large h-hypergraphs with a fixed diameter.
Discret. Math.
Ioan Tomescu
1999 J jnl
Some Extremal Properties of the Degree Distance of a Graph.
Discret. Appl. Math.
Ioan Tomescu
1998 J jnl
A Threshold Property Concerning Words Containing All Short Factors.
Bull. EATCS
Ioan Tomescu
1998 J jnl
Chromatic Coefficients of Linear Uniform Hypergraphs.
J. Comb. Theory B
Ioan Tomescu
1998 J jnl
On Words Containing all Short Subwords.
Theor. Comput. Sci.
Ioan Tomescu
1997 J jnl
Maximum chromatic polynomial of 3-chromatic blocks.
Discret. Math.
Ioan Tomescu
1997 J jnl
On the number of trees having k edges in common with a graph of bounded degrees.
Discret. Math.
Ioan Tomescu
1997 J jnl
Optimum Extendible Prefix Codes.
J. Univers. Comput. Sci.
Cristian Calude, Ioan Tomescu
1997 J jnl
Optimum Huffman Forests.
J. Univers. Comput. Sci.
Ioan Tomescu
1996 J jnl
An asymptotic formula for the number of graphs having small diameter.
Discret. Math.
Ioan Tomescu
1996 J jnl
Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs.
Eur. J. Comb.
Dragos Radu Popescu, Ioan Tomescu
1996 J jnl
Negative Cycles in Complete Signed Graphs.
Discret. Appl. Math.
Dragos Radu Popescu, Ioan Tomescu
1996 J jnl
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet.
Theor. Comput. Sci.
Ioan Tomescu
1996 J jnl
On the number of irreducible coverings by edges of complete bipartite graphs.
Discret. Math.
Ioan Tomescu
1996 J jnl
The number of digraphs with small diameter.
Australas. J Comb.
Ioan Tomescu
1994 J jnl
Maximum chromatic polynomials of 2-connected graphs.
J. Graph Theory
Ioan Tomescu
1994 J jnl
Minimum Spanning Hypertrees.
Discret. Appl. Math.
Ioan Tomescu, Marius Zimand
1994 J jnl
On the Number of Subtrees for Almost All Graphs.
Random Struct. Algorithms
Ioan Tomescu
1992 J jnl
Ordered h-hypertrees.
Discret. Math.
Ioan Tomescu
1990 J jnl
Almost all digraphs have a kernel.
Discret. Math.
Ioan Tomescu
1990 J jnl
Maximal chromatic polynomials of connected planar graphs.
J. Graph Theory
Ioan Tomescu
1988 J jnl
Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons.
Discret. Appl. Math.
Alexandru T. Balaban, Ioan Tomescu
1987 J jnl
Graphical Eulerian numbers and chromatic generating functions.
Discret. Math.
Ioan Tomescu
1987 J jnl
On 3-colorings of bipartite
J. Graph Theory
Ioan Tomescu
1986 J jnl
Hypertrees and Bonferroni inequalities.
J. Comb. Theory B
Ioan Tomescu
1986 J jnl
On the number of paths and cycles for almost all graphs and digraphs.
Comb.
Ioan Tomescu
1984 J jnl
Digital metrics: A graph-theoretical approach.
Pattern Recognit. Lett.
Frank Harary, Robert A. Melter, Ioan Tomescu
1984 J jnl
Metric bases in digital geometry.
Comput. Vis. Graph. Image Process.
Robert A. Melter, Ioan Tomescu
1983 J jnl
On Hamiltonian-connected regular graphs.
J. Graph Theory
Ioan Tomescu
1983 J jnl
Path generated digital metrics.
Pattern Recognit. Lett.
Robert A. Melter, Ioan Tomescu
1982 J jnl
Boolean distance for graphs.
Discret. Math.
Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
1981 J jnl
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets.
Discret. Math.
Ioan Tomescu
1980 J jnl
Some properties of irreducible coverings by cliques of complete multipartite graphs.
J. Comb. Theory B
Ioan Tomescu
1979 J jnl
Le nombre minimal de colorations d'un hypergraphe k-chromatique.
Discret. Math.
Ioan Tomescu
1976 J jnl
Le nombre maximal de colorations d'un graphe hamiltonien.
Discret. Math.
Ioan Tomescu
1974 J jnl
La reduction minimale d'un graphe a une reunion de cliques.
Discret. Math.
Ioan Tomescu
1973 J jnl
A Combinatorial Algorithm for Solving Covering Problems.
IEEE Trans. Computers
Ioan Tomescu
1972 J jnl
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine.
IEEE Trans. Computers
Ioan Tomescu
1972 J jnl
A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines.
Math. Syst. Theory
Ioan Tomescu
1972 J jnl
Le nombre maximal de 3-colorations d'un graphe connexe.
Discret. Math.
Ioan Tomescu
1970 J jnl
A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network.
IEEE Trans. Computers
Ioan Tomescu