Ioan Tomescu

Publication Activity (10 Years)

Years Active: 1970-2023
Publications (10 Years): 13

Top Topics

Closely Related

Connected Graphs

Maximum Common Subgraph

Top Venues

Discret. Appl. Math.

Electron. J. Graph Theory Appl.

Publications

Ioan Tomescu
Extremal quasi-unicyclic graphs with respect to vertex-degree function index. Electron. J. Graph Theory Appl. 11 (1) (2023)
Ioan Tomescu
Minimizing vertex-degree function index for k-generalized quasi-unicyclic graphs. Art Discret. Appl. Math. 5 (1) (2022)
Ioan Tomescu
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number. Discret. Appl. Math. 306 (2022)
Muhuo Liu, Ioan Tomescu, Jianping Liu
Unified extremal results for k-apex unicyclic graphs (trees). Discret. Appl. Math. 288 (2021)
Muhuo Liu, Kun Cheng, Ioan Tomescu
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices. Discret. Appl. Math. 284 (2020)
Faisal Javaid, Muhammad Kamran Jamil, Ioan Tomescu
Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices. Discret. Appl. Math. 270 (2019)
Ioan Tomescu
Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2. Discret. Appl. Math. 267 (2019)
Mihaita Dragan, Ioan Tomescu
Bicyclic Connected Graphs Having Smallest Degree Distances. SYNASC (2019)
Ioan Tomescu
Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number. Art Discret. Appl. Math. 2 (1) (2019)
Muhammad Kamran Jamil, Ioan Tomescu
First Reformulated Zagreb Index And Some Graph Operations. Ars Comb. 138 (2018)
Muhammad Kamran Jamil, Ioan Tomescu
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number. Discret. Appl. Math. 222 (2017)
Ioan Tomescu
On the general sum-connectivity index of connected graphs with given order and girth. Electron. J. Graph Theory Appl. 4 (1) (2016)
Muhammad Imran, Syed Ahtsham Ul Haq Bokhary, Abdul Qudair Baig, Ioan Tomescu
On metric dimension of convex polytopes with pendant edges. Ars Comb. 125 (2016)
Rozica-Maria Tache, Ioan Tomescu
General Sum-Connectivity Index with α ≥ 1 for Trees and Unicyclic Graphs with k Pendants. SYNASC (2015)
Ioan Tomescu, Misbah Arshad
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices. Discret. Appl. Math. 181 (2015)
Ioan Tomescu, Sana Javed
Extremal Bicyclic 3-Chromatic Graphs. Graphs Comb. 31 (4) (2015)
Muhammad Imran, Abdul Qudair Baig, Muhammad Kashif Shafiq, Ioan Tomescu
On Metric Dimension of Generalized Petersen Graphs P(n, 3). Ars Comb. 117 (2014)
Ioan Tomescu, Salma Kanwal
Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index. Discret. Appl. Math. 164 (2014)
Ioan Tomescu
Hypergraphs with pendant paths are not chromatically unique. Discuss. Math. Graph Theory 34 (1) (2014)
Ioan Tomescu
2-Connected graphs with minimum general sum-connectivity index. Discret. Appl. Math. 178 (2014)
Ioan Tomescu, Sana Javed
On the Chromaticity of Quasi Linear Hypergraphs. Graphs Comb. 29 (6) (2013)
Ioan Tomescu
Some Results on Chromaticity of Quasi-Linear Paths and Cycles. Electron. J. Comb. 19 (2) (2012)
Ioan Tomescu
On the Connected Partition Dimension of a Wheel Related Graph. Computation, Physics and Beyond (2012)
Ioan Tomescu, Akhlaq Ahmad Bhatti
On The Cyclomatic Number Of Linear Hypergraphs. Ars Comb. 106 (2012)
M. Tariq Rahim, Ioan Tomescu
Multi-level distance labelings for helm graphs. Ars Comb. 104 (2012)
Ioan Tomescu, Muhammad Imran
-Sets of Connected Graphs. Graphs Comb. 27 (4) (2011)
Ngurah Anak Agung Gede, Edy Tri Baskoro, Ioan Tomescu
Magic graphs with pendant edges. Ars Comb. 99 (2011)
Ioan Tomescu
Ordering connected graphs having small degree distances. Discret. Appl. Math. 158 (15) (2010)
Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary
Series-parallel chromatic hypergraphs. Discret. Appl. Math. 158 (3) (2010)
Syed Ahtsham Ul Haq Bokhary, Ioan Tomescu, Akhlaq Ahmad Bhatti
On the Chromaticity of Multi-Bridge Hypergraphs. Graphs Comb. 25 (2) (2009)
Ioan Tomescu
Properties of connected graphs having minimum degree distance. Discret. Math. 309 (9) (2009)
Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs. Graphs Comb. 25 (4) (2009)
Liviu Petrisor Dinu, Ioan Tomescu
From rankings' collinearity to counting SDR's via chromatic list expression. Int. J. Comput. Math. 86 (9) (2009)
Surahmat, Edy Tri Baskoro, Ioan Tomescu
The Ramsey Numbers of Large cycles Versus Odd Wheels. Graphs Comb. 24 (1) (2008)
Ioan Tomescu
Discrepancies between metric dimension and partition dimension of a connected graph. Discret. Math. 308 (22) (2008)
Ioan Tomescu
Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet. J. Autom. Lang. Comb. 13 (2) (2008)
Ioan Tomescu
. Discret. Appl. Math. 155 (11) (2007)
Ioan Tomescu, Imran Javaid, Slamin
On the partition dimension and connected partition dimension of wheels. Ars Comb. 84 (2007)
Ioan Tomescu
On the chromaticity of sunflower hypergraphs SH(n, p, h). Discret. Math. 307 (6) (2007)
Surahmat, Edy Tri Baskoro, Ioan Tomescu
The Ramsey numbers of large cycles versus wheels. Discret. Math. 306 (24) (2006)
Ioan Tomescu
A characterization of the words occurring as factors in a minimum number of words. Theor. Comput. Sci. 352 (1-3) (2006)
Ioan Tomescu
Asymptotic Properties of the Factors of Words Over a Finite Alphabet. Fundam. Informaticae 64 (1-4) (2005)
Ioan Tomescu
Almost all graphs and h-hypergraphs have small diameter. Australas. J Comb. 31 (2005)
Ioan Tomescu
Sunflower hypergraphs are chromatically unique. Discret. Math. 285 (1-3) (2004)
Ioan Tomescu
Maximal σ-polynomials of connected 3-chromatic graphs. J. Graph Theory 43 (3) (2003)
Ioan Tomescu
On the number of occurrences of all short factors in almost all words. Theor. Comput. Sci. 290 (3) (2003)
Ioan Tomescu
On the number of h-connected graphs with a fixed diameter. Discret. Math. 252 (1-3) (2002)
Ioan Tomescu
Irreducible Coverings by Cliques and Sperner's Theorem. Electron. J. Comb. 9 (1) (2002)
Ioan Tomescu
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. COCOON (2002)
Ioan Tomescu
On the number of graphs and h-hypergraphs with bounded diameter. Discret. Math. 235 (1-3) (2001)
Ioan Tomescu
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity. DMTCS (2001)
Ioan Tomescu
The number of h-strongly connected digraphs with small diameter. Australas. J Comb. 24 (2001)
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
Complex Roots of a Polynomial: 10688. Am. Math. Mon. 107 (2) (2000)
Ioan Tomescu
On the number of large h-hypergraphs with a fixed diameter. Discret. Math. 223 (1-3) (2000)
Ioan Tomescu
Some Extremal Properties of the Degree Distance of a Graph. Discret. Appl. Math. 98 (1-2) (1999)
Ioan Tomescu
On Words Containing all Short Subwords. Theor. Comput. Sci. 197 (1-2) (1998)
Ioan Tomescu
Chromatic Coefficients of Linear Uniform Hypergraphs. J. Comb. Theory, Ser. B 72 (2) (1998)
Ioan Tomescu
A Threshold Property Concerning Words Containing All Short Factors. Bull. EATCS 64 (1998)
Ioan Tomescu
On the number of trees having k edges in common with a graph of bounded degrees. Discret. Math. 169 (1-3) (1997)
Ioan Tomescu
Optimum Huffman Forests. J. Univers. Comput. Sci. 3 (7) (1997)
Ioan Tomescu
Maximum chromatic polynomial of 3-chromatic blocks. Discret. Math. 172 (1-3) (1997)
Cristian Calude, Ioan Tomescu
Optimum Extendible Prefix Codes. J. Univers. Comput. Sci. 3 (11) (1997)
Dragos Radu Popescu, Ioan Tomescu
Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs. Eur. J. Comb. 17 (5) (1996)
Ioan Tomescu
An asymptotic formula for the number of graphs having small diameter. Discret. Math. 156 (1-3) (1996)
Dragos Radu Popescu, Ioan Tomescu
Negative Cycles in Complete Signed Graphs. Discret. Appl. Math. 68 (1-2) (1996)
Ioan Tomescu
The number of digraphs with small diameter. Australas. J Comb. 14 (1996)
Ioan Tomescu
On the number of irreducible coverings by edges of complete bipartite graphs. Discret. Math. 150 (1-3) (1996)
Ioan Tomescu
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet. Theor. Comput. Sci. 164 (1&2) (1996)
Ioan Tomescu
Maximum chromatic polynomials of 2-connected graphs. J. Graph Theory 18 (4) (1994)
Ioan Tomescu
On the Number of Subtrees for Almost All Graphs. Random Struct. Algorithms 5 (1) (1994)
Ioan Tomescu, Marius Zimand
Minimum Spanning Hypertrees. Discret. Appl. Math. 54 (1) (1994)
Ioan Tomescu
Ordered h-hypertrees. Discret. Math. 105 (1-3) (1992)
Ioan Tomescu
Maximal chromatic polynomials of connected planar graphs. J. Graph Theory 14 (1) (1990)
Ioan Tomescu
Almost all digraphs have a kernel. Discret. Math. 84 (2) (1990)
Alexandru T. Balaban, Ioan Tomescu
Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons. Discret. Appl. Math. 19 (1-3) (1988)
Ioan Tomescu
-threshold graphs. J. Graph Theory 11 (3) (1987)
Ioan Tomescu
Graphical Eulerian numbers and chromatic generating functions. Discret. Math. 66 (3) (1987)
Ioan Tomescu
Hypertrees and Bonferroni inequalities. J. Comb. Theory, Ser. B 41 (2) (1986)
Ioan Tomescu
On the number of paths and cycles for almost all graphs and digraphs. Comb. 6 (1) (1986)
Frank Harary, Robert A. Melter, Ioan Tomescu
Digital metrics: A graph-theoretical approach. Pattern Recognit. Lett. 2 (3) (1984)
Robert A. Melter, Ioan Tomescu
Metric bases in digital geometry. Comput. Vis. Graph. Image Process. 25 (1) (1984)
Ioan Tomescu
On Hamiltonian-connected regular graphs. J. Graph Theory 7 (4) (1983)
Robert A. Melter, Ioan Tomescu
Path generated digital metrics. Pattern Recognit. Lett. 1 (3) (1983)
Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
Boolean distance for graphs. Discret. Math. 39 (2) (1982)
Ioan Tomescu
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets. Discret. Math. 37 (2-3) (1981)
Ioan Tomescu
Some properties of irreducible coverings by cliques of complete multipartite graphs. J. Comb. Theory, Ser. B 28 (2) (1980)
Ioan Tomescu
Le nombre minimal de colorations d'un hypergraphe k-chromatique. Discret. Math. 25 (2) (1979)
Ioan Tomescu
Le nombre maximal de colorations d'un graphe hamiltonien. Discret. Math. 16 (4) (1976)
Ioan Tomescu
La reduction minimale d'un graphe a une reunion de cliques. Discret. Math. 10 (1) (1974)
Ioan Tomescu
A Combinatorial Algorithm for Solving Covering Problems. IEEE Trans. Computers 22 (2) (1973)
Ioan Tomescu
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine. IEEE Trans. Computers 21 (5) (1972)
Ioan Tomescu
Le nombre maximal de 3-colorations d'un graphe connexe. Discret. Math. 1 (4) (1972)
Ioan Tomescu
A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines. Math. Syst. Theory 6 (1) (1972)
Ioan Tomescu
A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network. IEEE Trans. Computers 19 (1) (1970)